Backjump-based techniques versus conflict-directed heuristics

Proceedings - International Conference on Tools with Artificial Intelligence, ICTAI

Volumn , Issue , 2004, Pages 549-557

  Lecoutre, Christophe ^a   Boussemart, Frédéric ^a   Hemery, Fred ^a  

^a UNIVERSITÉ D'ARTOIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BACKJUMP-BASED TECHNIQUES; BACKTRACKING ALGORITHMS (BT); CONFLICT-DIRECTED BACKJUMPING (CBJ) TECHNIQUE; CONSTRAINT SATISFACTION PROBLEM (CSP);

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; MATHEMATICAL TRANSFORMATIONS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

CONSTRAINT THEORY;

EID: 16244398026     PISSN: 10823409     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICTAI.2004.37     Document Type: Conference Paper

References (26)

1. F. Bacchus. Extending forward checking. In Proceedings of CP'00, pages 35-51, 2000.
2. A. Baker. The hazards of fancy backtracking. In Proceedings of AAAI'94, pages 288-293, 1994.
3. R. Bayardo and R. Shrag. Using CSP look-back techniques to solve real-world SAT instances. In Proceedings of AAAI'97, pages 203-208, 1997.
4. M. Beresin, E. Levin, and J. Winn. A chessboard coloring problem. The College Mathematics Journal, 20(2):106-114, 1989.
5. C. Bessière, P. Meseguer, E. Freuder, and J. Larrosa. On forward checking for non binary constraint satisfaction. Artificial Intelligence, 141:205-224, 2002.
6. C. Bessière and J. Régin. MAC and combined heuristics: two reasons to forsake FC (and CBJ?) on hard problems. In Proceedings of CP'96, pages 61-75, 1996.
7. C. Bessière and J. Régin. Refining the basic constraint propagation algorithm. In Proceedings of IJCAI'01, pages 309-315, 2001.
8. F. Boussemart, F. Hemery, C. Lecoutre, and L. Sais. Boosting systematic search by weighting constraints. In Proceedings of ECAI'04, pages 146-150, 2004.
9. X. Chen and P. van Beek. Conflict-directed backjumping revisited. Journal of Artificial Intelligence Research, 14:53-81, 2001.
10. R. Dechter. Enhancement schemes for constraint processing: backjumping, learning and cutset decomposition. Artificial Intelligence, 41:273-312, 1990.
11. R. Dechter and D. Frost. Backjump-based backtracking for constraint satisfaction problems. Artificial Intelligence, 136:147-188, 2002.
12. M. Ginsberg. Dynamic backtracking. Artificial Intelligence, 1:25-46, 1993.
13. G. Gottlob, N. Leone, and F. Scarcello. A comparison of structural csp decomposition methods. Artificial Intelligence, 124:243-282, 2000.
14. R. Haralick and G. Elliott. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14:263-313, 1980.
15. N. Jussien, R. Debruyne, and P. Boizumault. Maintaining arc-consistency within dynamic backtracking. In Proceedings of CP'00, pages 249-261, 2000.
16. C. Lecoutre, F. Boussemart, and F. Hemery. Exploiting multidirectionality in coarse-grained arc consistency algorithms. In Proceedings of CP'03, pages 480-494, 2003.
17. C. Lecoutre, F. Boussemart, F. Hemery, and S. Merchez. Abscon 2.1, a constraint programming platform. http://www.cril.univ-artois.fr/~lecoutre, November 2004.
18. A. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8:118-126, 1977.
19. B. Nadel. Tree search and arc consistency in constraint satisfaction algorithms. Search in Artificial Intelligence, pages 287-342, 1988.
20. P. Prosser. Hybrid algorithms for the constraint satisfaction problems. Computational Intelligence, 9(3):268-299, 1993.
21. P. Prosser. MAC-CBJ: maintaining arc consistency with conflict-directed backjumping. Technical report, Department of Computer Science, University of Strathclyde, 1995.
22. D. Sabin and E. Freuder. Contradicting conventional wisdom in constraint satisfaction. In Proceedings of the PPCPA'94, Seattle WA, 1994.
23. d an efficient arc consistency algorithm with a low space complexity. In Proceedings of CP'02, pages 755-760, 2002.
24. G. Verfaillie and T. Schiex. Dynamic backtracking for dynamic CSPs. In Proceedings of ECAI'94 workshop on constraint satisfaction issues raised by practical applications, 1994.
25. R. Wallace. Why AC3 is almost always better than AC4 for establishing arc consistency in CSPs. In Proceedings of IJCAI'93, pages 239-245, 1993.
26. Y. Zhang and R. Yap. Making AC3 an optimal algorithm. In Proceedings of IJCAI'01, pages 316-321, Seattle WA, 2001.