Zobrazeno 1 - 10
of 20 343
pro vyhledávání: '"Vardi, Moshe"'
Inspired by recent progress in dynamic programming approaches for weighted model counting, we investigate a dynamic-programming approach in the context of boolean realizability and synthesis, which takes a conjunctive-normal-form boolean formula over
Externí odkaz:
http://arxiv.org/abs/2405.07975
Consider an agent acting to achieve its temporal goal, but with a "trembling hand". In this case, the agent may mistakenly instruct, with a certain (typically small) probability, actions that are not intended due to faults or imprecision in its actio
Externí odkaz:
http://arxiv.org/abs/2404.16163
As robots become more prevalent, the complexity of robot-robot, robot-human, and robot-environment interactions increases. In these interactions, a robot needs to consider not only the effects of its own actions, but also the effects of other agents'
Externí odkaz:
http://arxiv.org/abs/2403.04910
We introduce a method for translating an alternating weak B\"uchi automaton (AWA), which corresponds to a Linear Dynamic Logic (LDL) formula, to an unambiguous B\"uchi automaton (UBA). Our translations generalise constructions for Linear Temporal Log
Externí odkaz:
http://arxiv.org/abs/2305.09966
The innovations in reactive synthesis from {\em Linear Temporal Logics over finite traces} (LTLf) will be amplified by the ability to verify the correctness of the strategies generated by LTLf synthesis tools. This motivates our work on {\em LTLf mod
Externí odkaz:
http://arxiv.org/abs/2305.08319
In the study of reactive systems, qualitative properties are usually easier to model and analyze than quantitative properties. This is especially true in systems where mutually beneficial cooperation between agents is possible, such as multi-agent sy
Externí odkaz:
http://arxiv.org/abs/2305.00953
Autor:
Vardi, Moshe Y., Zhang, Zhiwei
Determining the satisfiability of Boolean constraint-satisfaction problems with different types of constraints, that is hybrid constraints, is a well-studied problem with important applications. We study here a new application of hybrid Boolean const
Externí odkaz:
http://arxiv.org/abs/2301.09833
While the Ising model remains essential to understand physical phenomena, its natural connection to combinatorial reasoning makes it also one of the best models to probe complex systems in science and engineering. We bring a computational lens to the
Externí odkaz:
http://arxiv.org/abs/2212.12812
Autor:
Vardi, Moshe Y., Zhang, Zhiwei
We propose and study the graph-theoretical problem EXISTS-PMVC: the existence of perfect matching under vertex-color constraints on graphs with bi-colored edges. EXISTS-PMVC is of special interest because of its motivation from quantum-state identifi
Externí odkaz:
http://arxiv.org/abs/2209.13063
The determinization of a nondeterministic B\"uchi automaton (NBA) is a fundamental construction of automata theory, with applications to probabilistic verification and reactive synthesis. The standard determinization constructions, such as the ones b
Externí odkaz:
http://arxiv.org/abs/2206.13739