Stochastic Boolean Satissability

Satissability problems and probabilistic models are core topics of ar-tiicial intelligence and computer science. This paper looks at the rich intersection between these two areas, opening the door for the use of satissability approaches in probabilistic domains. The paper examines a generic stochastic satissability problem , SSat, which can function for probabilistic domains as Sat does for deterministic domains. It shows the connection between SSat and well studied problems in belief network inference and planning under uncertainty, and deenes algorithms, both systematic and stochastic, for solving SSat instances. These algorithms are validated on random SSat formulae generated under the xed-clause model. In spite of the large complexity gap between SSat (PSPACE) and Sat (NP), the paper suggests that much of what we have learned about Sat transfers to the probabilistic domain.

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

[2]  Christos H. Papadimitriou,et al.  Games against nature , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[3]  Ewald Speckenmeyer,et al.  Solving satisfiability in less than 2n steps , 1985, Discret. Appl. Math..

[4]  John N. Tsitsiklis,et al.  The Complexity of Markov Decision Processes , 1987, Math. Oper. Res..

[5]  V. Rich.  Personal communication , 1989, Nature.

[6]  Anne Condon,et al.  The Complexity of Stochastic Games , 1992, Inf. Comput..

[7]  Bruce A. Reed,et al.  Mick gets some (the odds are on his side) (satisfiability) , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[8]  Bart Selman,et al.  Local search strategies for satisfiability testing , 1993, Cliques, Coloring, and Satisfiability.

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

[10]  Joan Feigenbaum,et al.  Random debaters and the hardness of approximating stochastic functions , 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

[11]  Gerald L. Thompson,et al.  A Computational Study of Satisfiability Algorithms for Propositional Logic , 1994, INFORMS J. Comput..

[12]  Tail Bounds for Occupancy and the Satisfiability Threshold Conjecture , 1995, Random Struct. Algorithms.

[13]  J. Hooker,et al.  Branching Rules for Satissability , 1995 .

[14]  Alan M. Frieze,et al.  Analysis of Two Simple Heuristics on a Random Instance of k-SAT , 1996, J. Algorithms.

[15]  Bart Selman,et al.  Pushing the Envelope: Planning, Propositional Logic and Stochastic Search , 1996, AAAI/IAAI, Vol. 2.

[16]  Toniann Pitassi,et al.  Simplified and improved resolution lower bounds , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[17]  Jun Gu,et al.  Algorithms for the satisfiability (SAT) problem: A survey , 1996, Satisfiability Problem: Theory and Applications.

[18]  James M. Crawford,et al.  Experimental Results on the Crossover Point in Random 3-SAT , 1996, Artif. Intell..

[19]  Dirk C. Mattfeld,et al.  A Computational Study , 1996 .

[20]  Rina Dechter,et al.  Bucket elimination: A unifying framework for probabilistic inference , 1996, UAI.

[21]  Roberto J. Bayardo,et al.  Using CSP Look-Back Techniques to Solve Real-World SAT Instances , 1997, AAAI/IAAI.

[22]  Chu Min Li,et al.  Heuristics Based on Unit Propagation for Satisfiability Problems , 1997, IJCAI.

[23]  E. Allender,et al.  Encyclopaedia of Complexity Results for Finite-Horizon Markov Decision Process Problems , 1997 .

[24]  Marco Schaerf,et al.  Experimental Analysis of the Computational Cost of Evaluating Quantified Boolean Formulae , 1997, AI*IA.

[25]  Michael L. Littman,et al.  Probabilistic Propositional Planning: Representations and Complexity , 1997, AAAI/IAAI.

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

[27]  L. Kirousis,et al.  Approximating the unsatisfiability threshold of random formulas , 1998, Random Struct. Algorithms.

[28]  Toby Walsh,et al.  Beyond NP: the QSAT phase transition , 1999, AAAI/IAAI.

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

[30]  A. Borodin,et al.  Threshold phenomena in random graph colouring and satisfiability , 1999 .

[31]  Eli Ben-Sasson,et al.  Short proofs are narrow—resolution made simple , 2001, JACM.