Constraint metrics for local search

Lecture Notes in Computer Science

Volumn 3569, Issue , 2005, Pages 269-281

  Southey, Finnegan ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN ALGEBRA; COMPUTATIONAL METHODS;

BOOLEAN ASSIGNMENTS; CONSTRAINT SATISFACTION PROBLEM (CSP); LOCAL SEARCH METRICS; SOLVERS FOR PREPOSITIONAL SATISFIABILITY (SAT);

PROBLEM SOLVING;

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

References (17)

1. Roberto Battiti. Reactive search: Toward self-tuning heuristics. In V. J. Rayward-Smith, I. H. Osman, C. R. Reeves, and G. D. Smith, editors, Modem Heuristic Search Methods, pages 61-83. John Wiley & Sons Ltd., Chichester, 1996.
2. Byungki Cha and Kazuo Iwama. Performance Test of Local Search Algorithms Using New Types of Random CNF Formulas. In Proceedings of 14th International Joint Conference on Artificial Intelligence (IJCAI-95), pages 304-311. Kyushu University, 1995.
3. Byungki Cha and Kazuo Iwama. Adding New Clauses for Faster Local Search. In Proceedings of the 13th National Conference on Artificial Intelligence (AAAI-96), pages 332-337, 1996.
4. Moti Frances and Ami Litman. On Covering Problems of Codes. In Theory of Computing Systems, volume 30, pages 113-119, March 1997.
5. Ian P. Gent and Toby Walsh. Towards an Understanding of Hill-Climbing Procedures for SAT. In Proceedings of the 10th National Conference on Artificial Intelligence (AAAI-93), pages 28-33, 1993.
6. Holger Hoos. On the Run-time Behaviour of Stochastic Local Search Algorithms for SAT. In Proceedings of the 16th National Conference on Artificial Intelligence (AAAI-99), pages 661-666. MIT Press, 1999.
7. Holger H. Hoos and Thomas Stützle. SATLIB: An Online Resource for Research on SAT. In I. P. Gent, H von Maaren, and T. Walsh, editors, Proceedings of the 3rd International Symposium on the Theory and Applications of Satisfiability Testing (SAT 2000), pages 283-292. IOS Press, 2000.
8. Eric Horvitz, Yongshao Ruan, Carla P. Gomes, Henry Kautz, Bart Selman, and David Maxwell Chickering. A Bayesian approach to tackling hard computational problems. In Proceedings of the 17th Conference on Uncertainty and Artificial Intelligence (UAI 2001), pages 235-244, August 2001.
9. Frank Hutter, Dave A. D Tompkins, and Holger H. Hoos. Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT. In Proceedings of the 8th International Conference on the Principles and Practice of Constraint Programming (CP-2002), 2002.
10. David McAllester, Bart Selman, and Henry Kautz. Evidence for Invariants in Local Search. In Proceedings of the 14th National Conference on Artificial Intelligence (AAAI-97). AT&T Laboratories, 1997.
11. Dale Schuurmans and Finnegan Southey. Local search characteristics of incomplete SAT procedures. Artificial Intelligence, 132(2):121-150, 2001.
12. Dale Schuurmans, Finnegan Southey, and Robert C. Holte. The exponentiated subgradient algorithm for heuristic boolean programming. In Proceedings of 17th International Joint Conference on Artificial Intelligence (IJCAI-2001), volume 1, pages 334-341, 2001.
13. Bart Selman, Henry A. Kautz, and Bram Cohen. Noise Strategies for Improving Local Search. In Proceedings of the 12th National Conference on Artificial Intelligence (AAAI-94). AT&T Bell Labs, July 1994.
14. Bart Selman, Hector Levesque, and David Mitchell. A New Method for Solving Hard Satisfiability Problems. In Proceedings of the 10th National Conference on Artificial Intelligence (AAAI-92), pages 440-446. AT&T, University of Toronto, Simon Fraser, 1992.
15. J. R. Thornton, D. N. Pham, S. Bain, and V. Ferreira Jr. Additive versus Multiplicative Clause Weighting for SAT. In Proceedings of the 19th National Conference on Artificial Intelligence (AAAI-2004), 2004.
16. Zhe Wu and Benjamin W. Wah. Solving Hard Satisfiability Problems: A Unified Algorithm Based On Discrete Lagrange Multipliers. In Proceedings of 11th IEEE Conference on Tools with Artificial Intelligence. UIUC, November 1999.
17. Zhe Wu and Benjamin W. Wah. Trap Escaping Strategies in Discrete Lagrangian Methods for Solving Hard Satisfiability and Maximum Satisfiability Problems. In Proceedings of the 16th National Conference on Artificial Intelligence (AAAI-99), 1999.