Improving stochastic local search for SAT with a new probability distribution

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6175 LNCS, Issue , 2010, Pages 10-15

  Balint, Adrian ^a   Fröhlich, Andreas ^a  

^a UNIVERSITY OF ULM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

LOCAL MINIMUMS; RANDOM WALK; SAT INSTANCES; SAT PROBLEMS; SATISFIABILITY PROBLEMS; STOCHASTIC LOCAL SEARCHES;

COMPETITION;

PROBABILITY DISTRIBUTIONS;

EID: 77954965528     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14186-7_3     Document Type: Conference Paper

References (8)

1. Balint, A., Henn, M., Gableske, O.: A novel approach to combine a SLS- and a DPLL-Solver for the satisfiability problem. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 284-297. Springer, Heidelberg (2009)
2. bwGRiD, member of the German D-Grid initiative, funded by the Ministry for Education and Research and the Ministry for Science, Research and Arts Baden-Württemberg, http://www.bw-grid.de
3. Hoos, H.H.: An adaptive noise mechanism for WalkSAT. In: Proceedings of AAAI 2002, pp. 635-660 (2002)
4. Li, C.M., Huang, W.Q.: Diversification and determinism in local search for satisfiability. In: Bacchus, F., Walsh, T. (eds.) SAT 2005. LNCS, vol. 3569, pp. 158-172. Springer, Heidelberg (2005)
5. McAllester, D., Selman, B., Kautz, H.: Evidence for invariant in local search. In: Proceedings of AAAI 1997, pp. 321-326 (1997)
6. Pham, D.N., Thornton, J.R., Gretton, C., Sattar, A.: Advances in local search for satisfiability. In: Australian Conference on Artificial Intelligence 2007, pp. 213-222 (2007)
7. The SAT Competition Homepage: http://www.satcompetition.org
8. Thornton, J., Pham, D.N., Bain, S., Ferreira Jr., V.: Additive versus multiplicative clause weighting for SAT. In: Proceedings of 19th AAAI 2004, pp. 191-196 (2004)