Algorithms and complexity results for #SAT and Bayesian inference

Bayesian inference is an important problem with numerous applications in probabilistic reasoning. Counting satisfying assignments is a closely related problem of fundamental theoretical importance. In this paper, we show that plain old DPLL equipped with memorization (an algorithm we call #DPLLCache) can solve both of these problems with time complexity that is at least as good as state-of-the-art exact algorithms, and that it can also achieve the best known time-space tradeoff. We then proceed to show that there are instances where #DPLLCache can achieve an exponential speedup over existing algorithms.

[1]  Adnan Darwiche,et al.  Recursive conditioning , 2001, Artif. Intell..

[2]  Stephen A. Cook,et al.  The Relative Efficiency of Propositional Proof Systems , 1979, Journal of Symbolic Logic.

[3]  Donald W. Loveland,et al.  A machine program for theorem-proving , 2011, CACM.

[4]  Craig Boutilier,et al.  Context-Specific Independence in Bayesian Networks , 1996, UAI.

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

[6]  Rina Dechter,et al.  Bucket Elimination: A Unifying Framework for Reasoning , 1999, Artif. Intell..

[7]  Neil Robertson,et al.  Graph Minors .XIII. The Disjoint Paths Problem , 1995, J. Comb. Theory B.

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

[9]  Hilary Putnam,et al.  A Computing Procedure for Quantification Theory , 1960, JACM.

[10]  Maria Luisa Bonet,et al.  Exponential separations between restricted resolution and cutting planes proof systems , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[11]  Russell Impagliazzo,et al.  Memoization and DPLL: formula caching proof systems , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

[12]  David J. Spiegelhalter,et al.  Local computations with probabilities on graphical structures and their application to expert systems , 1990 .

[13]  Toniann Pitassi,et al.  Value Elimination: Bayesian Interence via Backtracking Search , 2002, UAI.

[14]  RobertsonNeil,et al.  Graph minors. XIII , 1994 .

[15]  Rina Dechter,et al.  Resolution versus Search: Two Strategies for SAT , 2000, Journal of Automated Reasoning.

[16]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[17]  Paul D. Seymour,et al.  Graph minors. X. Obstructions to tree-decomposition , 1991, J. Comb. Theory, Ser. B.

[18]  Michael L. Littman,et al.  MAXPLAN: A New Approach to Probabilistic Planning , 1998, AIPS.

[19]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems , 1988 .