138 citations · 778 across the 69 of their papers we have counts for
6 papers · 1 filter
Constrained Sampling and Counting: Universal Hashing Meets SAT Solving
Kuldeep S. Meel, Moshe Vardi, Supratik Chakraborty +5
Constrained sampling and counting are two fundamental problems in artificial intelligence with a diverse range of applications, spanning probabilistic reasoning and planning to con…
Approximate Probabilistic Inference via Word-Level Counting
Supratik Chakraborty, Kuldeep S. Meel, Rakesh Mistry +1
Hashing-based model counting has emerged as a promising approach for large-scale probabilistic inference on graphical models. A key component of these techniques is the use of xor-…
Fixpoint Node Selection Query Languages for Trees
Diego Calvanese, Giuseppe De Giacomo, Maurizio Lenzerini +1
The study of node selection query languages for (finite) trees has been a major topic in the recent research on query languages for Web documents. On one hand, there has been an ex…
SAT-based Explicit LTL Reasoning
Jianwen Li, Shufang Zhu, Geguang Pu +1
We present here a new explicit reasoning framework for linear temporal logic (LTL), which is built on top of propositional satisfiability (SAT) solving. As a proof-of-concept of th…
Mode-Target Games: Reactive Synthesis for Control Applications
Ayca Balkan, Moshe Vardi, Paulo Tabuada
In this paper we introduce a class of Linear Temporal Logic (LTL) specifications for which the problem of synthesizing controllers can be solved in polynomial time. The new class o…
The Complexity of Synthesis from Probabilistic Components
Krishnendu Chatterjee, Laurent Doyen, Moshe Y. Vardi
The synthesis problem asks for the automatic construction of a system from its specification. In the traditional setting, the system is "constructed from scratch" rather than compo…