An Exhaustive DPLL Algorithm for Model Counting

State-of-the-art model counters are based on exhaustive DPLL algorithms, and have been successfully used in probabilistic reasoning, one of the key problems in AI. In this article, we present a new exhaustive DPLL algorithm with a formal semantics, a proof of correctness, and a modular design. The modular design is based on the separation of the core model counting algorithm from SAT solving techniques. We also show that the trace of our algorithm belongs to the language of Sentential Decision Diagrams (SDDs), which is a subset of Decision-DNNFs, the trace of existing state-of-the-art model counters. Still, our experimental analysis shows comparable results against state-of-the-art model counters. Furthermore, we obtain the first top-down SDD compiler, and show orders-of-magnitude improvements in SDD construction time against the existing bottom-up SDD compiler.

[1]  Simone Bova.  SDDs Are Exponentially More Succinct than OBDDs , 2016, AAAI.

[2]  Leslie G. Valiant,et al.  The Complexity of Computing the Permanent , 1979, Theor. Comput. Sci..

[3]  Sharad Malik,et al.  Chaff: engineering an efficient SAT solver , 2001, Proceedings of the 38th Design Automation Conference (IEEE Cat. No.01CH37232).

[4]  Adnan Darwiche,et al.  New Compilation Languages Based on Structured Decomposability , 2008, AAAI.

[5]  Marc Thurley,et al.  sharpSAT - Counting Models with Advanced Component Caching and Implicit BCP , 2006, SAT.

[6]  Guy Van den Broeck,et al.  Tractable Learning for Structured Probability Spaces: A Case Study in Learning Preference Distributions , 2015, IJCAI.

[7]  Guy Van den Broeck,et al.  Probabilistic Sentential Decision Diagrams , 2014, KR.

[8]  A. Darwiche,et al.  The Language of Search , 2007, J. Artif. Intell. Res..

[9]  Luc De Raedt,et al.  Anytime Inference in Probabilistic Logic Programs with Tp-Compilation , 2015, IJCAI.

[10]  Adnan Darwiche,et al.  Compiling Bayesian Networks with Local Structure , 2005, IJCAI.

[11]  Adnan Darwiche,et al.  On probabilistic inference by weighted model counting , 2008, Artif. Intell..

[12]  Adnan Darwiche,et al.  RSat 2.0: SAT Solver Description , 2006 .

[13]  Manfred Jaeger,et al.  Compiling relational Bayesian networks for exact inference , 2006, Int. J. Approx. Reason..

[14]  Manuel Blum,et al.  Equivalence of Free Boolean Graphs can be Decided Probabilistically in Polynomial Time , 1980, Inf. Process. Lett..

[15]  Christian J. Muise,et al.  Dsharp: Fast d-DNNF Compilation with sharpSAT , 2012, Canadian Conference on AI.

[16]  Eliezer L. Lozinskii,et al.  The Good Old Davis-Putnam Procedure Helps Counting Models , 2011, J. Artif. Intell. Res..

[17]  Umut Oztok,et al.  On Compiling CNF into Decision-DNNF , 2014, CP.

[18]  Roberto J. Bayardo,et al.  Counting Models Using Connected Components , 2000, AAAI/IAAI.

[19]  Igor Razgon.  On OBDDs for CNFs of Bounded Treewidth , 2014, KR.

[20]  Adnan Darwiche,et al.  A Logical Approach to Factoring Belief Networks , 2002, KR.

[21]  Luc De Raedt,et al.  Inference and learning in probabilistic logic programs using weighted Boolean formulas , 2013, Theory and Practice of Logic Programming.

[22]  Adnan Darwiche,et al.  New Advances in Compiling CNF into Decomposable Negation Normal Form , 2004, ECAI.

[23]  Pierre Marquis,et al.  A Knowledge Compilation Map , 2002, J. Artif. Intell. Res..

[24]  Adnan Darwiche,et al.  Using DPLL for Efficient OBDD Construction , 2004, SAT.

[25]  Toniann Pitassi,et al.  Combining Component Caching and Clause Learning for Effective Model Counting , 2004, SAT.

[26]  Adnan Darwiche,et al.  Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence SDD: A New Canonical Representation of Propositional Knowledge Bases , 2022 .

[27]  Adnan Darwiche,et al.  Basing Decisions on Sentences in Decision Diagrams , 2012, AAAI.

[28]  Michael L. Littman,et al.  Using Caching to Solve Larger Probabilistic Planning Problems , 1998, AAAI/IAAI.

[29]  Umut Oztok,et al.  A Top-Down Compiler for Sentential Decision Diagrams , 2015, IJCAI.

[30]  Dan Roth,et al.  On the Hardness of Approximate Reasoning , 1993, IJCAI.

[31]  Adnan Darwiche,et al.  Compiling Probabilistic Graphical Models Using Sentential Decision Diagrams , 2013, ECSQARU.

[32]  Adnan Darwiche,et al.  Dynamic Minimization of Sentential Decision Diagrams , 2013, AAAI.

[33]  Paul Beame,et al.  New Limits for Knowledge Compilation and Applications to Exact Model Counting , 2015, UAI.

[34]  Henry A. Kautz,et al.  Performing Bayesian Inference by Weighted Model Counting , 2005, AAAI.

[35]  Adnan Darwiche,et al.  A New Clause Learning Scheme for Efficient Unsatisfiability Proofs , 2008, AAAI.

[36]  Alessio Lomuscio,et al.  Verification of Multi-Agent Systems via SDD-based Model Checking , 2015, AAMAS.

[37]  Sofia Cassel,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 2012 .

[38]  Ricardo Herrmann,et al.  Algebraic Sentential Decision Diagrams in Symbolic Probabilistic Planning , 2013, 2013 Brazilian Conference on Intelligent Systems.

[39]  Adnan Darwiche,et al.  A compiler for deterministic, decomposable negation normal form , 2002, AAAI/IAAI.