Jul 11, 2019 · Abstract: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 Decision Diagrams as the main data struc- ture. We implement this technique in ADDMC, a new model.

Apr 3, 2020 · Our algorithm employs dynamic programming and uses Algebraic Decision Diagrams as the main data structure. We implement this technique in ADDMC, ...

We present an algorithm to compute exact literal-weighted model counts of Boolean formulas in conjunctive normal form. Our algorithm employs dynamic programming.

ADDMC computes exact literal-weighted model counts of formulas in conjunctive normal form. MS thesis: Weighted Model Counting with Algebraic Decision Diagrams.

Our algorithm employs dynamic programming and uses algebraic decision diagrams as the primary data structure. We implement this technique in ADDMC, a new model ...

ADDMC: Weighted Model Counting with Algebraic Decision Diagrams. Jeffrey M. Dudek, Vu H. N. Phan (presenter), Moshe Y. Vardi. Computer Science Department ...

This work compares ADDMC to state-of-the-art exact model counters on the two largest CNF model counting benchmark families (BayesNet and Planning) and ...

Our algorithm employs dynamic programming and uses Algebraic Decision Diagrams as the main data structure. We implement this technique in ADDMC, a new model ...

Jeffrey M. Dudek, Vu Phan, Moshe Y. Vardi: ADDMC: Weighted Model Counting with Algebraic Decision Diagrams. AAAI 2020: 1468-1476.