ADDMC: Weighted Model Counting with Algebraic Decision Diagrams
Logic in Computer Science
2020-06-03 v2 Artificial Intelligence
Data Structures and Algorithms
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 primary data structure. We implement this technique in ADDMC, a new model counter. We empirically evaluate various heuristics that can be used with ADDMC. We then compare ADDMC to state-of-the-art exact weighted model counters (Cachet, c2d, d4, and miniC2D) on 1914 standard model counting benchmarks and show that ADDMC significantly improves the virtual best solver.
Keywords
Cite
@article{arxiv.1907.05000,
title = {ADDMC: Weighted Model Counting with Algebraic Decision Diagrams},
author = {Jeffrey M. Dudek and Vu H. N. Phan and Moshe Y. Vardi},
journal= {arXiv preprint arXiv:1907.05000},
year = {2020}
}
Comments
Presented at AAAI 2020