An empirical study of dynamic variable ordering heuristics for the constraint satisfaction problem

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

Volumn 1118, Issue , 1996, Pages 179-193

  Gent, Ian P ^a   MacIntyre, Ewan ^a   Prosser, Patrick ^a   Smith, Barbara M ^b   Walsh, Toby ^c  

^a UNIVERSITY OF STRATHCLYDE   (United Kingdom)

^b UNIVERSITY OF LEEDS   (United Kingdom)

^c ITC IRST   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957879262     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61551-2_74     Document Type: Conference Paper

References (23)

1. D. Brelaz. New methods to color the vertices of a graph. JACM, 22(4):251-256, 1979.
2. P. Cheeseman, B. Kanefsky, and W.M. Taylor. Where the really hard problems are. In Proc. IJCAI-91, pages 331-337, 1991.
3. R. Dechter and I. Meiri. Experimental evaluation of preprocessing algorithms for constraint satisfaction problems. Artificial Intelligence, 68:211-241, 1994.
4. R. Feldman and M.C. Golumbic. Interactive schednling as a constraint satisfaction problem. Annals of Mathematics and Artificial Intelligence, 1:49-73, 1990.
5. J. Gaschnig. A general backtracking algorithm that eliminates most redundant tests. In Proc. IJCAI-77, page 457, 1977.
6. J. Gaschnig. Performance measurement and analysis of certain search algorithms. Tech. rep. CMU-CS-79-124, Carnegie-Mellon University, 1979.
7. LP. Gent, E. Maclntyre, P. Prosser, and T. Walsh. Scaling effects in the CSP phase transition. In Principles and Practice of Constraint Programming, pages 70-87. Springer, 1995.
8. LP. Gent, E. Maclntyre, P. Prosser, and T. Walsh. The constrainedness of search. In Proc. AAAI-96, 1996.
9. LP. Gent and T. Walsh. Easy problems are sometimes hard. Artificial Intelligence, 70:335-345, 1994.
10. M.L. Ginsberg. Dynamic backtracking. JAIR, 1:25-46, 1993.
11. SW. Golomb and L.D. Baumert. Backtrack programming. JACM, 12:516-524 1965.
12. S. Grant and B.M. Smith. The phase transition behaviour of maintaining arc consistency. In Proc. ECAI-96, pages 175-179, 1996.
13. R.M. Haialick and G.L. Elliott. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14:263-313, 1980.
14. B. Nudel. Consistent-labeling problems and their algorithms: Expected-complexities and theory-based heuristics. Artificial Intelligence, 21:135-178, 1983.
15. P. Prosser. Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 9(3):268-299, 1993.
16. P. Prosser. An empirical study of phase transitions in binary constraint satisfaction problems. Artificial Intelligence, 81 (l-2):15, 1995.
17. P.W. Purdom. Search rearrangement backtracking and polynomial average time. Artificial Intelligence, 21:117-133, 1983.
18. D. Sabin and E.C. Freuder. Contradicting conventional wisdom in constraint satisfaction. In Proc. ECAI-94, pages 125-129, 1994.
19. B.M Smith and M.E. Dyer. Locating the phase transition in binary constraint satisfaction problems. Artificial Intelligence, 81 (1-2):15, 1996.
20. B.M. Smith and S. Grant. Sparse constraint graphs and exceptionally hard problems. In Proc. IJCAI-95, pages 646-651, 1995.
21. E.P.K. Tsang. Foundations of Constraint Satisfaction. Academic Press 1993
22. E.P.K. Tsang, J.E. Borrett, and A.C.M. Kwan. An attempt to map the performance of a range of algorithm and heuristc combinations. In Hybrid Problems Hybrid Solutions, pages 203-216. IOS Press, 1995. Proceedings of AISB-95
23. C.P. Williams and T. Hogg. Exploiting the deep structure of constraint problems. Artificial Intelligence, 70:73-117, 1994.