DPER: Dynamic Programming for Exist-Random Stochastic SAT

1 code implementation • 19 May 2022 • Vu H. N. Phan, Moshe Y. Vardi

Both MAP and ER-SSAT have the form $\operatorname{argmax}_X \sum_Y f(X, Y)$, where $f$ is a real-valued function over disjoint sets $X$ and $Y$ of variables.

Bayesian Inference Fairness

DPO: Dynamic-Programming Optimization on Hybrid Constraints

1 code implementation • 17 May 2022 • Vu H. N. Phan, Moshe Y. Vardi

Since a Bayesian network can be encoded as a literal-weighted CNF formula $\varphi$, we study Boolean MPE, a more general problem that requests a model $\tau$ of $\varphi$ with the highest weight, where the weight of $\tau$ is the product of weights of literals satisfied by $\tau$.

Bayesian Inference

DPMC: Weighted Model Counting by Dynamic Programming on Project-Join Trees

1 code implementation • 20 Aug 2020 • 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.

Tree Decomposition

ADDMC: Weighted Model Counting with Algebraic Decision Diagrams

1 code implementation • 11 Jul 2019 • 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.