Configuration landscape analysis and backbone guided local search. Part I: Satisfiability and maximum satisfiability

Artificial Intelligence

Volumn 158, Issue 1, 2004, Pages 1-26

  Zhang, Weixiong ^a  

^a WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

Author keywords

Backbone; Backbone guided search; Boolean satisfiability; Configuration landscape; Local search; Maximum Boolean satisfiability; Search

Indexed keywords

ALGORITHMS; BOOLEAN ALGEBRA; PATTERN RECOGNITION; PHASE TRANSITIONS; PLANNING; PROBLEM SOLVING; SCHEDULING;

BACKBONE; BACKBONE GUIDED SEARCH; BOOLEAN SATISFIABILITY; CONFIGURATION LANDSCAPE; LOCAL SEARCH; MAXIMUM BOOLEAN SATISFIABILITY; SEARCH;

ARTIFICIAL INTELLIGENCE;

EID: 3142698600     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.artint.2004.04.001     Document Type: Article

References (33)

1. Beck J.C., Fox M.S. A generic framework for constraint-directed search and scheduling. AI Magazine. 19:(4):1998;101-130.
2. K.D. Boese, Models for iterative global optimization, PhD Thesis, UCLA/Computer Science Department, Los Angeles, CA, 1996.
3. Boese K.D., Kahng A.B., Muddu S. New adaptive multistart techniques for combinatorial global optimizations. Oper. Res. Lett. 16:1994.
4. Cheeseman P., Kanefsky B., Taylor W.M. Where the really hard problems are. Proc. IJCAI-91, Sydney, Australia. 1991;331-337.
5. Codognet P., Rossi F. Notes for the ECAI2000 tutorial on solving and programming with soft constraints: Theory and practice. Available at http://www.math.unipd.it/~frossi/papers.html.
6. Cook S.A. The complexity of theorem-proving procedures. Proc. 3rd IEEE Symposium on the Foundations of Computer Science, FOCS-71, East Lansing, MI. 1971;151-158.
7. Davis M., Logemann G., Loveland D. A machine program for theorem proving. Comm. ACM. 5:1962;394-397.
8. Dechter R. Constraint Processing. 2003;Morgan Kaufmann, San Francisco, CA.
9. Dubois O., Dequen G. A backbone-search heuristic for efficient solving of hard 3-SAT formula. Proc. IJCAI-01, Seattle, WA. 2001;248-253.
10. Freuder E.C., Wallace R.J. Partial constraint satisfaction. Artificial Intelligence. 58:1992;21-70.
11. Garey M.R., Johnson D.S. Computers and Intractability: A Guide to the Theory of NP-Completeness. 1979;Freeman, New York.
12. Gomes C.P., Hogg T., Walsh T., Zhang W. IJCAI-2001 tutorial: Phase transitions and structure in combinatorial problems. http://www.cs.wustl.edu/ ~zhang/links/ijcai-phase-transitions.html:2001;
13. Hogg T., Huberman B.A., Williams C. Phase transitions and the search problem. Artificial Intelligence. 81:1996;1-15.
14. Hoos H.H. An adaptive noise mechanism for WalkSAT. Proc. AAAI-02, Edmonton, AB. 2002;655-660.
15. Hoos H.H., Stuzle T. SATLIB - The satisfiability library. http://www.informatik.tu-darmstadt.de/AI/SATLIB:1999;
16. Huberman B.A., Hogg T. Phase transitions in artificial intelligence systems. Artificial Intelligence. 33:1987;155-171.
17. Jaynes E.T. The rationale of maximum entropy methods. Proc. IEEE. 70:1982;939-952.
18. Jiang Y., Kautz H., Selman B. Solving problems with hard and soft constraints using a stochastic algorithm for MAX-SAT. Proc. 1st Workshop on AI and OR, Timberine, OR. 1995.
19. Kautz H., Selman B. Pushing the envelope: Planning, propositional logic, and stochastic search. Proc. AAAI-96, Portland, OR. 1996;1194-1201.
20. Kirkpatrick S., Toulouse G. Configuration space analysis of traveling salesman problems. J. Phys. (France). 46:1985;1277-1292.
21. Lin S., Kernighan B.W. An effective heuristic algorithm for the traveling salesman problem. Oper. Res. 21:1973;498-516.
22. McAllester D., Selman B., Kautz H. Evidence for invariants in local search. Proc. AAAI-97, Providence, RI. 1997;321-326.
23. Mitchell D., Selman B., Levesque H. Hard and easy distributions of SAT problems. Proc. AAAI-92, San Jose, CA. 1992;459-465.
24. Monasson R., Zecchina R., Kirkpatrick S., Selman B., Troyansky L. Determining computational complexity from characteristic 'phase transitions'. Nature. 400:1999;133-137.
25. Patterson D.J., Kautz H. Auto-Walksat: A self-tuning implementation of Walksat. Electronic Notes in Discrete Mathematics (ENDM). vol. 9:2001;Elsevier, Amsterdam. Presented at the LICS 2001 Workshop on Theory and Applications of Satisfiability Testing, June 14-15, Boston University, MA, 2001.
26. Pemberton J.C., Zhang W. Epsilon-transformation: Exploiting phase transitions to solve combinatorial optimization problems. Artificial Intelligence. 81:1996;297-325.
27. Selman B., Kautz H., Cohen B. Noise strategies for local search. Proc. AAAI-94, Seattle, WA. 1994;337-343.
28. Selman B., Levesque H., Mitchell D. A new method for solving hard satisfiability problems. Proc. AAAI-92, San Jose, CA. 1992;440-446.
29. Telelis O., Stamatopoulos P. Heuristic backbone sampling for maximum satisfiability. Proc. 2nd Hellenic Conf. on Artificial Intelligence. 2002;129-139.
30. Z. Xing, W. Zhang, A constraint sensitive algorithm for maximum satisfiability, 2003, in preparation.
31. Zhang W. Phase transitions and backbones of 3-SAT and maximum 3-SAT. Proc. Internat. Conf. on Principles and Practice of Constraint Programming (CP-01), Paphos, Cyprus. 2001;153-167.
32. Zhang W., Looks M. Backbone guided local search for the traveling salesman. 5th Metaheuristic International Conference, Kyoto, Japan. 2003.
33. Zhang W., Rangan A., Looks M. Backbone guided local search for maximum satisfiability. Proc. IJCAI-03, Acapulco, Mexico. 2003;1179-1184.