9 citations · 20 across the 6 of their papers we have counts for
8 papers
Ising Model Partition Function Computation as a Weighted Counting Problem
Shaan A. Nagy, Roger Paredes, Jeffrey M. Dudek +2
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 sy…
Taming Discrete Integration via the Boon of Dimensionality
Jeffrey M. Dudek, Dror Fried, Kuldeep S. Meel
Discrete integration is a fundamental problem in computer science that concerns the computation of discrete sums over exponentially large sets. Despite intense interest from resear…
DPMC: Weighted Model Counting by Dynamic Programming on Project-Join Trees
Jeffrey M. Dudek, Vu H. N. Phan, Moshe Y. Vardi
We propose a unifying dynamic-programming framework to compute exact literal-weighted model counts of formulas in conjunctive normal form. At the center of our framework are projec…
Parallel Weighted Model Counting with Tensor Networks
Jeffrey M. Dudek, Moshe Y. Vardi
A promising new algebraic approach to weighted model counting makes use of tensor networks, following a reduction from weighted model counting to tensor-network contraction. Prior…
Efficient Contraction of Large Tensor Networks for Weighted Model Counting through Graph Decompositions
Jeffrey M. Dudek, Leonardo Dueñas-Osorio, Moshe Y. Vardi
Constrained counting is a fundamental problem in artificial intelligence. A promising new algebraic approach to constrained counting makes use of tensor networks, following a reduc…
ADDMC: Weighted Model Counting with Algebraic Decision Diagrams
Jeffrey M. Dudek, Vu H. N. Phan, Moshe Y. Vardi
We present an algorithm to compute exact literal-weighted model counts of Boolean formulas in Conjunctive Normal Form. Our algorithm employs dynamic programming and uses Algebraic…
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…
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…