138 citations · 778 across the 69 of their papers we have counts for
5 papers · 1 filter
The Hard Problems Are Almost Everywhere For Random CNF-XOR Formulas
Jeffrey M. Dudek, Kuldeep S. Meel, Moshe Y. Vardi
Recent universal-hashing based approaches to sampling and counting crucially depend on the runtime performance of SAT solvers on formulas expressed as the conjunction of both CNF c…
On Hashing-Based Approaches to Approximate DNF-Counting
Kuldeep S. Meel, Aditya A. Shrotri, Moshe Y. Vardi
Propositional model counting is a fundamental problem in artificial intelligence with a wide variety of applications, such as probabilistic inference, decision making under uncerta…
A Symbolic Approach to Safety LTL Synthesis
Shufang Zhu, Lucas M. Tabajara, Jianwen Li +2
Temporal synthesis is the automated design of a system that interacts with an environment, using the declarative specification of the system's behavior. A popular language for prov…
Symbolic LTLf Synthesis
Shufang Zhu, Lucas M. Tabajara, Jianwen Li +2
LTLf synthesis is the process of finding a strategy that satisfies a linear temporal specification over finite traces. An existing solution to this problem relies on a reduction to…
Combining the -CNF and XOR Phase-Transitions
Jeffrey M. Dudek, Kuldeep S. Meel, Moshe Y. Vardi
The runtime performance of modern SAT solvers on random -CNF formulas is deeply connected with the 'phase-transition' phenomenon seen empirically in the satisfiability of random…