Abstract

Stochastic local search (SLS) algorithms for the propositional satisfiability problem (SAT) have been successfully applied to solve suitably encoded search problems from various domains. One drawback of these algorithms is that they are usually incomplete. We refine the notion of incompleteness for stochastic decision algorithms by introducing the notion of "probabilistic asymptotic completeness" (PAC) and prove for a number of well-known SLS algorithms whether or not they have this property. We also give evidence for the practical impact of the PAC property and show how to achieve the PAC property and significantly improved performance in practice for some of the most powerful SLS algorithms for SAT, using a simple and general technique called "random walk extension".

Citations

3011	Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images - Geman - 1984
318	Noise strategies for improving local search - Selman, Kautz, et al. - 1994
161	Evidence for Invariants in Local Search - McAllester, Selman, et al. - 1997
122	Towards an understanding of hill-climbing procedures for SAT - Gent, Walsh - 1993
100	Efficient local search for very large-scale satisfiability problem - Gu - 1992
90	On selecting a satisfying truth assignment - Papadimitriou - 1991
73	Pushing the Envelope - Kautz, Selman
72	Report on a SAT competition - Buro, Buening - 1992
49	Evaluating Las Vegas algorithms — pitfalls and remedies - Hoos, Stützle - 1998
47	An empirical analysis of search in GSAT - Gent, Walsh - 1993
39	Tuning local search for satisfiability testing - Parkes, Walser - 1996