A mixture-model for the behaviour of SLS algorithms for SAT

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2002, Pages 661-667

  Hoos, Holger H ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; MARKOV PROCESSES; MATHEMATICAL MODELS; PROBLEM SOLVING;

STOCHASTIC LOCAL SEARCH (SLS) ALGORITHMS;

ARTIFICIAL INTELLIGENCE;

EID: 0036931880     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (21)

1. Bayardo, R., and Pehoushek, J. D. 2000. Counting Models using Connected Components. In Proc. AAAI-2000, 157-162.
2. Cheeseman, P.; Kanefsky, B.; and Taylor, W. M. 1991. Where the Really Hard Problems Are. In Proc. IJCAI-91, 331-337.
3. Frank, J.; Cheeseman, P.; and Stutz, J. 1997. When Gravity Fails: Local Search Topology. (Electronic) J. of Artificial Intelligence Research 7:249-281.
4. Gent, I. P., and Walsh, T. 1993. Towards an understanding of hill-climbing procedures for SAT. In Proc. AAAI-93, 28-33.
5. Gomes, C. P.; Selman, B.; and Kautz, H. 1998. Boosting Combinatorial Search Through Randomization. In Proc. AAAI-98, 431-437.
6. Gu, J. 1992. Efficient local search for very large-scale satisfiability problems. ACM SIGART Bulletin 3(1):8-12.
7. Hoos, H., and Stützle, T. 1999. Towards a Characterisation of the Behaviour of Stochastic Local Search Algorithms for SAT. Artif. Intelligence 112:213-232.
8. Hoos, H., and Stützle, T. 2000a. Local search algorithms for SAT: An empirical evaluation. J. Automated Reasoning 24:421-481.
9. Hoos, H., and Stützle, T. 2000b. SATLIB: An Online Resource for Research on SAT. In I.P. Gent, H. M., and Walsh, T., eds., SAT 2000, 283-292. IOS Press.
10. Hoos, H. 1998. Stochastic Local Search - Methods, Models, Applications. Ph.D. Dissertation, TU Darmstadt, Germany.
11. Hoos, H. 1999. SAT-encodings, search space structure, and local search performance. In Proc. IJCAI-99, 296-302.
12. Li, C. M., and Anbulagan. 1997. Look-ahead versus look-back for satisfiability problems. In Proc. CP'97, 341-355. Springer Verlag.
13. McAllester, D.; Selman, B.; and Kautz, H. 1997. Evidence for invariants in local search. In Proc. IJCAI-97, 321-326.
14. Parkes, A. J. 1997. Clustering at the Phase Transition. In Proc. AAAI-97, 340-345.
15. Schuurmans, D., and Southy, F. 2000. Local search characteristics of incomplete SAT procedures. Artif. Intelligence 132:121-150.
16. Schuurmans, D.; Southy, F.; and Holte, R. 2001. The exponentiated subgradient algorithm for heuristic boolean programming. In Proc. IJCAI-01.
17. Selman, B.; Kautz, H. A.; and Cohen, B. 1994. Noise strategies for improving local search. In Proc. AAAI-94, 337-343.
18. Singer, J.; Gent, I. P.; and Smaill, A. 2000. Backbone fragility and the local search cost peak. J. of Artificial Intelligence Research 12:235-270.
19. Wah, B., and Shang, Y. 1997. Discrete Lagrangian-Based Search for Solving MAX-SAT Problems. In Proc. IJCAI-97, 378-393.
20. Wu, Z., and Wah, B. 2000. An Efficient Global-Search Strategy in Discrete Lagrangian Methods for Solving Hard Satisfiability Problems. In Proc. AAAI-2000, 310-315.
21. Yokoo, M. 1997. Why Adding More Constraints Makes a Problem Easier for Hill-Climbing Algorithms: Analyzing Landscapes of CSPs. In Proc. CP-97, number 1330 in LNCS, 357-370. Springer Verlag.