Towards a characterization of the behaviour of stochastic local search algorithms for SAT

Artificial Intelligence

Volumn 112, Issue 1, 1999, Pages 213-232

  Hoos, Holger H ^a   Stützle, Thomas ^b  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

KNOWLEDGE ENGINEERING; PARALLEL PROCESSING SYSTEMS; RANDOM PROCESSES; STATISTICAL METHODS;

PROPOSITIONAL SATISFIABILITY PROBLEMS (SAT); STOCHASTIC LOCAL SEARCH (SLS) ALGORITHMS;

LEARNING ALGORITHMS;

EID: 0033170342     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(99)00048-X     Document Type: Article

References (28)

1. H. Alt, L. Guibas, K. Mehlhorn, R. Karp, A. Wigderson, A method for obtaining randomized algorithms with small tail probabilities, Algorithmica 16 (1996) 543-547.
2. R.E. Barlow, F. Proschan, Statistical Theory of Reliability and Life Testing, Holt, Reinhart and Winston, 1981 (Reprint).
3. J.M. Crawford, L.D. Auton, Experimental results on the crossover point in Random-3-SAT, Artificial Intelligence 81 (1-2) (1996) 31-57.
4. D. Frost, I. Rish, L. Vila, Summarizing CSP hardness with continuous probability distributions, in: Proc. AAAI-97, Providence, RI, 1997, pp. 327-333.
5. I.P. Gent, T. Walsh, Towards an understanding of hill-climbing procedures for SAT, in: Proc. AAAI-93, Washington, DC, 1993, pp. 18-33.
6. I.P. Gent, T. Walsh, An empirical analysis of search in GSAT, Washington, DC, J. Artificial Intelligence Res. 1 (1993) 47-59.
7. C.P. Gomes, B. Selman, N. Crato, Heavy-tailed distributions in combinatorial search, in: Proc. CP-97, Lecture Notes in Computer Science, Vol. 1330, Springer, Berlin, 1997, pp. 121-135.
8. J. Gu, Efficient local search for very large-scale satisfiability problems, SIGART Bulletin 3 (1992) 8-12.
9. T. Hogg, B.A. Huberman, C.P. Williams, Phase transitions and the search problem (Editorial), Artificial Intelligence 81 (1-2) (1996) 1-16.
10. T. Hogg, C.P. Williams, Expected gains from parallelizing constraint solving for hard problems, in: Proc. AAAI-94, Seatle, WA, 1994, pp. 331-336.
11. T. Hogg, Refining the phase transition in combinatorial search, Artificial Intelligence 81 (1996) 127-154.
12. J.N. Hooker, Needed: An empirical science of algorithms, Oper. Res. 42 (2) (1994) 201-212.
13. J.N. Hooker, Testing heuristics: We have it all wrong, J. Heuristics (1996) 33-42.
14. H.H. Hoos, Stochastic Local Search - Methods, Models, Applications, Ph.D. Thesis, TU Darmstadt, Germany, 1998. Electronically available from http://www.cs.ubc.ca/spider/hoos/phd-thesis.html.
15. H.H. Hoos, On the run-time behaviour of stochastic local search algorithms for SAT, in: Proc. AAAI-99, Orlando, FL, 1999. Electronically available from http://www.cs.ubc.ca/spider/hoos/publ-ai.html.
16. H.H. Hoos, T. Stützle, Evaluating las vegas algorithms - Pitfalls and remedies, in: Proc. UAI-98, Morgan Kaufmann, San Mateo, CA, 1998, 238-245.
17. H.H. Hoos, T. Stützle, Characterizing the run-time behavior of stochastic local search, Technical Report AIDA-98-1, FG Intellektik, TU Darmstadt, 1998.
18. Y. Jiang, H. Kautz, B. Selman, Solving problems with hard and soft constraints using a stochastic algorithm for MAX-SAT, in: Proc. 1st Workshop on Artificial Intelligence and Operations Research, 1995.
19. H. Kautz, B. Selman, Pushing the envelope: Planning, propositional logic, and stochastic search, in: Proc. AAAI-96, Vol. 2, Portland, OR, MIT Press, Cambridge, MA, 1996, pp. 1194-1201.
20. M. Luby, A. Sinclair, D. Zuckerman, Optimal speedup of Las Vegas algorithms, Inform. Process. Lett. 47 (1993) 173-180.
21. D. McAllester, B. Selman, H. Kautz, Evidence for invariants in local search, in: Proc. AAAI-97, Providence, RI, 1997, pp. 321-326.
22. D. Mitchell, B. Selman, H. Levesque, Hard and easy distributions of SAT problems, in: Proc. AAAI-92, San Jose, CA, 1992, pp. 459-465.
23. S. Minton, Automatically configuring constraint satisfaction programs: A case study, Constraints 1 (1) 1996.
24. P. Morris, The breakout method for escaping from local minima, in: Proc. AAAI-93, Washington, DC, 1993, pp. 40-45.
25. V.K. Rohatgi, An Introduction to Probability Theory and Mathematical Statistics, Wiley, New York, 1976.
26. B. Selman, H.A. Kautz, B. Cohen, Noise strategies for improving local search, in: Proc. AAAI-94, Seatle, WA, MIT Press, Cambridge, MA, 1994, pp. 337-343.
27. B. Selman, H. Levesque, D. Mitchell, A new method for solving hard satisfiability problems, in: Proc. AAAI-92, San Jose, CA, MIT Press, Cambridge, MA, 1992, pp. 440-446.
28. T. Yokoo, Why adding more constraints makes a problem easier for hill-climbing algorithms: Analyzing landscapes of CSPs, in: Proc. CP-97, Springer, Berlin, 1997, pp. 357-370.