5 papers
DPER: Dynamic Programming for Exist-Random Stochastic SAT
Vu H. N. Phan, Moshe Y. Vardi
In Bayesian inference, the maximum a posteriori (MAP) problem combines the most probable explanation (MPE) and marginalization (MAR) problems. The counterpart in propositional logi…
DPO: Dynamic-Programming Optimization on Hybrid Constraints
Vu H. N. Phan, Moshe Y. Vardi
In Bayesian inference, the most probable explanation (MPE) problem requests a variable instantiation with the highest probability given some evidence. Since a Bayesian network can…
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…
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…
Syntactic Conditions for Antichain Property in Consistency Restoring Prolog
Vu Phan
We study syntactic conditions which guarantee when a CR-Prolog (Consistency Restoring Prolog) program has antichain property: no answer set is a proper subset of another. A notable…