Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break
Stochastic local search solvers for SAT made a large progress with the introduction of probability distributions like the ones used by the SAT Competition 2011 winners Sparrow2010 and EagleUp. These solvers though used a relatively complex decision heuristic, where probability distributions played a marginal role.
In this paper we analyze a pure and simple probability distribution based solver probSAT, which is probably one of the simplest SLS solvers ever presented. We analyze different functions for the probability distribution for selecting the next flip variable with respect to the performance of the solver. Further we also analyze the role of make and break within the definition of these probability distributions and show that the general definition of the score improvement by flipping a variable, as make minus break is questionable. By empirical evaluations we show that the performance of our new algorithm exceeds that of the SAT Competition winners by orders of magnitude.
KeywordsStochastic Local Search Random Walk Algorithm Satisfying Truth Assignment Variable Selection Heuristic Propagation Algorithm Scale
Unable to display preview. Download preview PDF.
- 3.Biere, A.: Lingeling and Friends at the SAT Competition 2011. Tehnical report 11/1, FMV Reports Series (2011), http://fmv.jku.at/papers/Biere-FMV-TR-11-1.pdf
- 4.bwGRiD, member of the German D-Grid initiative, funded by the Ministry for Education and Research (Bundesministerium für Bildung und Forschung) and the Ministry for Science, Research and Arts Baden-Württemberg (Ministerium für Wissenschaft, Forschung und Kunst Baden-Württemberg), http://www.bw-grid.de
- 6.Hoos, H.H.: An adaptive noise mechanism for WalkSAT. In: Proceedings of AAAI 2002, pp. 635–660 (2002)Google Scholar
- 10.McAllester, D., Selman, B., Kautz, H.: Evidence for invariant in local search. In: Proceedings of AAAI 1997, pp. 321–326 (1997)Google Scholar
- 11.Papadimitriou, C.H.: On selecting a satisfying truth assignment. In: Proceedings FOCS 1991, pp. 163–169. IEEE (1991)Google Scholar
- 12.Schöning, U.: A probabilistic algorithm for k-SAT and constraint satisfaction problems. In: Proceedings FOCS 1991, pp. 410–414. IEEE (1999)Google Scholar
- 14.Seitz, S., Alava, M., Orponen, P.: Focused local search for random 3-satisfiability. arXiv:cond-mat/051707v1 (2005)Google Scholar
- 16.The SAT Competition Homepage, http://www.satcompetition.org