On Top-Down Pseudo-Boolean Model Counting
Suwei Yang, Yong Lai, Kuldeep S. Meel

TL;DR
This paper introduces PBMC, the first exact top-down pseudo-Boolean model counter, which outperforms existing bottom-up counters in efficiency and instance coverage.
Contribution
The paper presents the first top-down approach for exact pseudo-Boolean model counting, including a new variable heuristic, demonstrating superior performance over existing counters.
Findings
PBMC counts 1849 instances, outperforming PBCount's 1773.
Top-down design shows promising results for PB model counting.
PBMC's variable heuristic improves counting efficiency.
Abstract
Pseudo-Boolean model counting involves computing the number of satisfying assignments of a given pseudo-Boolean (PB) formula. In recent years, PB model counting has seen increased interest partly owing to the succinctness of PB formulas over typical propositional Boolean formulas in conjunctive normal form (CNF) at describing problem constraints. In particular, the research community has developed tools to tackle exact PB model counting. These recently developed counters follow one of the two existing major designs for model counters, namely the bottom-up model counter design. A natural question would be whether the other major design, the top-down model counter paradigm, would be effective at PB model counting, especially when the top-down design offered superior performance in CNF model counting literature. In this work, we investigate the aforementioned top-down design for PB model…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
