Systematic vs. Local search for SAT

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

Volumn 1701, Issue , 1999, Pages 289-293

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

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^c DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

LEARNING ALGORITHMS; LOCAL SEARCH (OPTIMIZATION); STOCHASTIC SYSTEMS;

EMPIRICAL STUDIES; HYBRID ALGORITHMS; LOCAL SEARCH METHOD; PROBLEM INSTANCES; PROPOSITIONAL SATISFIABILITY PROBLEMS; SPECIFIC STRENGTH; STOCHASTIC LOCAL SEARCHES; SYSTEMATIC SEARCH ALGORITHM;

ARTIFICIAL INTELLIGENCE;

EID: 33749552096     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48238-5_25     Document Type: Conference Paper

References (10)

1. R.J. Bayardo Jr. and R.C. Schrag. Using CSP Look-back Techniques to Solve Real World SAT Instances. In Proceedings of AAAI'97, pages 203-208, 1997.
2. C.P. Gomes, B. Selman, and H. Kautz. Boosting Combinatorial Search Trough Randomization. In Proceedings of AAAI'98, pages 431-437. MIT press, 1998.
3. C.P. Gomes and B. Selman. Algorithm Portfolio Design: Theory vs. Practice. In UAI'97, Morgan Kaufmann, 1997.
4. I.P. Gent, H.H. Hoos, P. Prosser, and T. Walsh. Morphing: Combining Structure and Randomness. To appear in Proceedings of AAAI-99, 1999.
5. H.H. Hoos. Stochastic Local Search | Methods, Models, Applications. PhD thesis, Department of Computer Science, Darmstadt University of Technology, 1998. Available at http://www.cs.ubc.ca/spider/hoos/publ-ai.html
6. H.H. Hoos and T. Stützle. Local Search Algorithms for SAT: An Empirical Evaluation. Technical Report TR-99-06. Department of Computer Science, University of BC, Canada, 1999. Available at http://www.cs.ubc.ca/spider/hoos/publ-ai.html
7. H.H. Hoos and T. Stützle. Local Search Algorithms for SAT: An Empirical Evaluation. Submitted to Journal of Automated Reasoning, 1999.
8. H. Kautz and B. Selman. Pushing the Envelope: Planning, Propositional Logic, and Stochastic Search. In Proceedings of AAAI'96, pages 1194-1201. MIT Press, 1996.
9. C.M. Li and Anbulagan Look-Ahead Versus Lock-Back for Satisfiability Problems. In Proceedings of CP'97, pages 341-355. Springer Verlag, 1997.
10. D. McAllester, B. Selman, and H. Kautz. Evidence for Invariants in Local Search. In Proceedings of AAAI'97, pages 321-326, 1997.