Diversification and determinism in local search for satisfiability

Lecture Notes in Computer Science

Volumn 3569, Issue , 2005, Pages 158-172

  Li, Chu Min ^a   Huang, Wen Qi ^b  

^a UNIVERSITÉ DE PICARDIE JULES VERNE   (France)

^b HUAZHONG UNIVERSITY OF SCIENCE AND TECHNOLOGY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS;

R-NOVELTY HEURISTICS; SATISFIABILITY; WALKSAT FAMILY;

COMPUTER SCIENCE;

EID: 26444619376     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11499107_12     Document Type: Conference Paper

References (14)

1. S.A. Cook. The complexity of theorem-proving procedures. In Proceedings of 3rd Annual ACM Symp. Theory of Computing, pages 151-158, 1971.
2. A. Fukunaga. Efficient implementation of sat local search. In Proceedings of SAT-2004 (Seventh International Conf. on Theory and Applications of Satisfiability Testing, Vancouver, British Columbia, 2004.
3. I. Gent and T. Walsh. Towards an understanding of hill-climbing procedures for SAT. In Proceedings of AAAI-93, 1993.
4. E. A. Hirsch and A. Kojevnikov. Unitwalk: A new sat solver that uses local search guided by unit clause elimination. Annals of Mathematics and Artificial Intelligence, 43(1-4):91-111, 2005.
5. H. Hoos. On the run-time behavior of stochastic local search algorithms for sat. In Proceedings of AAAI-99, pages 661-666, 1999.
6. H. Hoos. An adaptive noise mechanism for walksat. In Proceedings of AAAI-02, pages 655-660. AAAI Press / The MIT Press, 2002.
7. W. Q. Huang and Jin Ren Chao. Solar: a learning from human algorithm for solving sat. Science in China (Series E), 27(2):179-186, 1997.
8. C.M. Li and Anbulagan. Look-Ahead Versus Look-Back for Satisfiability Problems. In Proceedings of CP-97, Third International Conference on Principles and Practice of Constraint Programming, pages 342-356. Springer-Verlag, LNCS 1330, Shloss Hagenberg, Austria, 1997.
9. B. Mazure, L. Saïs, and É. Grégoire. Tabu Search for SAT. In Proceedings of AAAI'97, 1997.
10. D.A. McAllester, B. Selman, and H. Kautz. Evidence for invariant in local search. In Proceedings of AAAI-97, pages 321-326, 1997.
11. D. Schuurmans and F. Southey. Local search characteristics of incomplete sat procedures. Artificial Intelligence, 132(2):121-150, 2001.
12. B. Selman and H. Kautz. Domain-independent extensions to gsat: Solving large structured satisfiability problems. In Proceedings of IJCAI-93, 1993.
13. B. Selman, H. Kautz, and B. Cohen. Noise strategies for improving local search. In Proceedings of AAAI-94, 12th National Conference on Artificial Intelligence, pages 337-343. AAAI Press, Seattle, USA, 1994.
14. B. Selman, D. Mitchell, and H. Levesque. A new Method for Solving Hard Satisfiability Problems. In Proceedings of AAAI'92, pages 440-446, 1992.