A Recursive Algorithm for Projected Model Counting

AAAI 2019 pp. 1536-1543

doi:10.1609/AAAI.V33I01.33011536 /aaai/2019/lagniez2019aaai-recursive/

Abstract

We present a recursive algorithm for projected model counting, i.e., the problem consisting in determining the number of models k∃X.Σk of a propositional formula Σ after eliminating from it a given set X of variables. Based on a ”standard” model counter, our algorithm projMC takes advantage of a disjunctive decomposition scheme of ∃X.Σ for computing k∃X.Σk. It also looks for disjoint components in its input for improving the computation. Our experiments show that in many cases projMC is significantly more efficient than the previous algorithms for projected model counting from the literature.

PDF AAAI Semantic Scholar

Cite

Text

Lagniez and Marquis. "A Recursive Algorithm for Projected Model Counting." AAAI Conference on Artificial Intelligence, 2019. doi:10.1609/AAAI.V33I01.33011536

Markdown

[Lagniez and Marquis. "A Recursive Algorithm for Projected Model Counting." AAAI Conference on Artificial Intelligence, 2019.](https://mlanthology.org/aaai/2019/lagniez2019aaai-recursive/) doi:10.1609/AAAI.V33I01.33011536

BibTeX

@inproceedings{lagniez2019aaai-recursive,
  title     = {{A Recursive Algorithm for Projected Model Counting}},
  author    = {Lagniez, Jean-Marie and Marquis, Pierre},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2019},
  pages     = {1536-1543},
  doi       = {10.1609/AAAI.V33I01.33011536},
  url       = {https://mlanthology.org/aaai/2019/lagniez2019aaai-recursive/}
}