Local search on sat-encoded colouring problems

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

Volumn 2919, Issue , 2004, Pages 105-119

  Prestwich, Steven ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING; CONSTRAINT SATISFACTION PROBLEMS; CONSTRAINT THEORY; LEARNING ALGORITHMS; LOCAL SEARCH (OPTIMIZATION);

BACKTRACK SEARCH; ENCODINGS; EXPERIMENTAL COMPARISON; GRAPH COLOURING; LOCAL SEARCH; SEARCH ALGORITHMS;

ENCODING (SYMBOLS);

EID: 35048876658     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24605-3_9     Document Type: Article

References (25)

1. C. Bessiere, E. Hebrard, T. Walsh. Local Consistencies in SAT. Sixth International Conference on Theory and Applications of Satisfiability Testing, Santa Margherita Ligure, Italy, 2003, pp. 400-407.
2. D. Clark, J. Frank, I. Gent, E. MacIntyre, N. Tomov, T. Walsh. Local Search and the Number of Solutions. Second International Conference on Principles and Practices of Constraint Programming, 1996, pp. 119-133.
3. M. Davis, G. Logemann, D. Loveland. A Machine Program for Theorem Proving. Communications of the ACM vol. 5, 1962, pp. 394-397.
4. M. Ernst, T. Millstein, D. Weld. Automatic SAT-Compilation of Planning Problems. Fifteenth International Joint Conference on Artificial Intelligence, Nagoya, Japan, 1997, pp. 1169-1176.
5. A. Frisch, T. Peugniez. Solving Non-Boolean Satisfiability Problems with Stochastic Local Search. Seventeenth International Joint Conference on Artificial Intelligence, Seattle, Washington, USA, 2001.
6. A. van Gelder. Another Look at Graph Coloring via Prepositional Satisfiability. Computational Symposium on Graph Coloring and its Generalizations, Ithaca, NY, 2002, pp. 48-54.
7. R. Genisson, P. Jegou. Davis and Putnam Were Already Forward Checking. Twelfth European Conference on Artificial Intelligence, Budapest, Hungary, 1996, pp. 180-184.
8. I. Gent. Arc Consistency in SAT. Fifteenth European Conference on Artificial Intelligence, Lyons, France, 2002.
9. Y. Hanatani, T. Horiyama, K. Iwama. Density Condensation of Boolean Formulas. Sixth International Conference on the Theory and Applications of Satisfiability Testing, Santa Margherita Ligure, Italy, 2003, pp. 126-133.
10. H. H. Hoos. SAT-Encodings, Search Space Structure, and Local Search Performance. Sixteenth International Joint Conference on Artificial Intelligence, Stockholm, Sweden, Morgan Kaufmann, 1999, pp. 296-302.
11. H. H. Hoos. Stochastic Local Search - Methods, Models, Applications. PhD thesis, CS Department, TU Darmstadt, 1998.
12. K. Iwama, S. Miyazaki. SAT-Variable Complexity of Hard Combinatorial Problems. IFIP World Computer Congress, Elsevier Science B. V., North-Holland, 1994, pp. 253-258.
13. S. Kasif. On the Parallel Complexity of Discrete Relaxation in Constraint Satisfaction Networks. Artificial Intelligence vol. 45, Elsevier, 1990, pp. 275-286.
14. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, S. Malik. Chaff: Engineering an Efficient SAT Solver. Proceedings of the Thirty Ninth Design Automation Conference, Las Vegas, June 2001.
15. A. J. Parkes. Lifted Search Engines for Satisfiability. PhD dissertation, University of Oregon, June 1999.
16. S. D. Prestwich. Negative Effects of Modeling Techniques on Search Performance. Annals of Operations Research vol. 18, Kluwer Academic Publishers, 2003, pp. 137-150.
17. S. D. Prestwich. Maintaining Arc-Consistency in Stochastic Local Search. Workshop on Techniques for Implementing Constraint Programming Systems, Ithaca, NY, 2002.
18. S. D. Prestwich, D. Higgins, O. O'Sullivan. A SAT-Based Approach to Multiple Sequence Alignment. Poster, Ninth International Conference on Principles and Practice of Constraint Programming, Kinsale, Ireland, 2003.
19. S. D. Prestwich, S. Bressan. A SAT Approach to Query Optimization in Mediator Systems. Fifth International Symposium on the Theory and Applications of Satisfiability Testing, University of Cincinnati, 2002, pp. 252-259.
20. Submitted to Annals of Mathematics and Artificial Intelligence.
21. D. Sabin, G. Freuder. Contradicting Conventional Wisdom in Constraint Satisfaction. Eleventh European Conference on Artificial Intelligence, 1994, pp. 125-129.
22. B. Selman, H. Kautz, B. Cohen. Noise Strategies for Improving Local Search. Twelfth National Conference on Artificial Intelligence, AAAI Press, 1994, pp. 337-343.
23. B. Selman, H. Levesque, D. Mitchell. A New Method for Solving Hard Satisfiability Problems. Tenth National Conference on Artificial Intelligence, MIT Press, 1992, pp. 440-446.
24. T. Walsh. SAT v CSP. Sixth International Conference on Principles and Practice of Constraint Programming, Lecture Notes in Computer Science vol. 1894, Springer-Verlag, 2000, pp. 441-456.
25. M. Yokoo. Why Adding More Constraints Makes a Problem Easier for Hill-climbing Algorithms: Analyzing Landscapes of CSPs. Proceedings of the Third International Conference on Principles and Practice of Constraint Programming. Lecture Notes in Computer Science vol. 1330, Springer-Verlag 1997, pp. 356-370.