## Stochastic Boolean Satisfiability (2000)

Venue: | Journal of Automated Reasoning |

Citations: | 49 - 2 self |

### BibTeX

@ARTICLE{Littman00stochasticboolean,

author = {Michael L. Littman and Stephen M. Majercik and Toniann Pitassi},

title = {Stochastic Boolean Satisfiability},

journal = {Journal of Automated Reasoning},

year = {2000},

volume = {27},

pages = {2001}

}

### Years of Citing Articles

### OpenURL

### Abstract

. Satisfiability problems and probabilistic models are core topics of artificial intelligence and computer science. This paper looks at the rich intersection between these two areas, opening the door for the use of satisfiability approaches in probabilistic domains. The paper examines a generic stochastic satisfiability 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 defines algorithms, both systematic and stochastic, for solving SSat instances. These algorithms are validated on random SSat formulae generated under the fixed-clause model. In spite of the large complexity gap between SSat (PSPACE) and Sat (NP), the paper suggests that much of what we've learned about Sat transfers to the probabilistic domain. 1. Introduction There has been a recent focus in artificial intelligence (AI) on solving problems exh...