MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems

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

Volumn 1118, Issue , 1996, Pages 61-75

  Bessière, Christian ^a   Régin, Jean Charles ^b  

^a LIRMM   (France)

^b IBM   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (33)

1. F. Bacchus and P. van Run. Dynamic variable ordering in csps. In Proceedings CP'95, pages 258-275, Cassis, France, 1995.
2. C. Bessière. Systèmes à contraintes 6volutifs en intelligence artificielle. Phd thesis, LIRMM, University of Montpellier II, September 1992. (in French).
3. C. Bessière, E.C. Freuder, and J.C. Régin. Using inference to reduce arc consistency computation. In Proceedings IJCAI'95, pages 592-598, Montréal, Canada, 1995.
4. R. Dechter. Learning while searching in constraint satisfaction problems. In Proceedings AAAI'86, pages 178-183, Philadelphia PA, 1986.
5. R. Dechter and I. Meiri. Experimental evaluation of preprocessing algorithms for constraint satisfaction problems. Artificial Intelligence, 68:211-241, 1994.
6. R. Dechter and J. Pearl. Network-based heuristics for constraint-satisfaction problems. Artificial Intelligence, 34:38, 1988.
7. M.J. Dent and R.E. Mercer. Using local topology to model hard binary constraint satisfaction problems. In Proceedings of the workshop -Studying and Solving Really Hard Problems-, CP'95, pages 52-61, Cassis, France, 1995.
8. O. Dubois. Private communication, 1995.
9. E.C. Freuder, A sufficient condition for backtrack-free search. Journal of the ACM, 29(1):24-32, 1982.
10. D. Frost and R. Dechter. In search of the best constraint satisfaction search. In Proceedings AAAI'94, pages 301-306, Seattle WA, 1994.
11. D. Frost and R. Dechter. Look-ahead value ordering for constraint satisfaction problems. In Proceedings IJCAI'95, pages 572-578, Montréal, Canada, 1995.
12. J. Gaschnig. A general backtrack algorithm that eliminates most redundant tests. In Proceedings IJCAI'77, page 457, Cambridge MA, 1977.
13. J. Gaschnig. Performance measurement and analysis of certain search algorithms. Technical Report CMU-CS-79-124, Carnegie-Mellon University, Pittsburgh PA, 1979.
14. P.A. Geelen. Dual viewpoint heuristics for binary constraint satisfaction problems. In Proceedings ECAI'92, pages 31-35, Vienna, Austria, 1992.
15. M.L. Ginsberg, M. Frank, M.E Halpin, and M.C. Torrance. Search lessons learned from crossword puzzles. In Proceedings AAAI'90, pages 210-215, Boston MA, 1990.
16. R.M. Haralick and G.L. Elliot. Increasing tree seach efficiency for constraint satisfaction problems. Artificial Intelligence, 14:263-313, 1980.
17. W.D. Harvey and M.L. Ginsberg. Limited discrepancy search. In Proceedings IJCAI'95, pages 607-613, Montrral, Canada, 1995.
18. ED. Hubbe and E.C. Freuder. An efficient cross product representation of the constraint satisfaction problem search space. In Proceedings AAAI'92, pages 421-427, San José CA, 1992.
19. V. Kumar. Algorithms for constraint-satisfaction problems: A survey. AI Magazine, 13(1):32-44, Spring 1992.
20. B.A. Nadel. Tree search and arc consistency in constraint satisfaction algorithms. In L.Kanal and V.Kumar, editors, Search in Artificial Intelligence, pages 287-342. Springer-Verlag, 1988.
21. B.A. Nadel. Constraint satisfaction algorithms. Computational Intelligence, 5:188-224, 1989.
22. E Prosser. Domain filtering can degrade intelligent backtracking search. In Proceedings IJCAl'93, pages 262-267, Chambrry, France, 1993.
23. E Prosser. Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 9(3):268-299, August 1993.
24. E Prosser. Binary constraint satisfaction problems: some are harder than others. In Proceedings ECAI'94, pages 95-99, Amsterdam, The Netherlands, 1994.
25. E Prosser. Mac-cbj: maintaining arc consistency with conflict-directed backjumping. Technical Report 95-177, Department of Computer Science, University of Starthclyde, 1995.
26. J.E. Puget, Ilog solver. In J. Gensel, editor, Journées Contraintes et Objets, Grenoble, France, November 1992. (in French).
27. EW. Purdom. Search rearrangement backtracking and polynomial average time. Artificial Intelligence, 21:117-133, 1983.
28. D. Sabin and E. Freuder. Contradicting conventional wisdom in constraint satisfaction. In Alan Boming, editor, PPCP'94: Second Workshop on Principles and Practice of Constraint Programming, Seattle WA, May 1994.
29. B. Smith. The phase transition in constraint satisfaction problems: A closer look at the mushy region. In Proceedings ECAI'94, pages 100-104, Amsterdam, The Netherlands, 1994.
30. B. Smith and S.A. Grant. Sparse constraint graphs and exceptionally hard problems. In Proceedings IJCAI'95, pages 646-651, Montrral, Canada, 1995.
31. B. Smith and S.A. Grant. Where the exceptionally hard problems are. In Proceedings of the workshop -Studying and Solving Really Hard Problems-, CP'95, pages 172-182, Cassis, France, 1995.
32. Pascal Van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press, Cambridge, MA, 1989.
33. R.J. Wallace and B.C. Freuder. Conjunctive width heuristics for maximal constraint satisfaction. In Proceedings AAAl'93, pages 762-768, Washington D.C., 1993.