Conflict-directed backjumping revisited

Journal of Artificial Intelligence Research

Volumn 14, Issue , 2001, Pages 53-81

  Chen, Xinguang ^a   Van Beek, Peter ^b  

^a UNIVERSITY OF ALBERTA   (Canada)

^b UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; FUNCTIONS; HEURISTIC METHODS;

CONFLICT-DIRECT BACKJUMPING (CBJ);

PROBLEM SOLVING;

EID: 0036375905     PISSN: 10769757     EISSN: None     Source Type: Journal    
DOI: 10.1613/jair.788     Document Type: Article

References (29)

1. Bacchus, F., & Grove, A. (1999). Looking forward in constraint satisfaction algorithms. Unpublished manuscript.
2. Bacchus, F., & van Run, P. (1995). Dynamic variable ordering in CSPs. In Proceedings of the First International Conference on Principles and Practice of Constraint Programming, pp. 258-275, Cassis, France. Available as: Springer Lecture Notes in Computer Science 976.
3. Bayardo Jr., R. J., & Schrag, R. (1996). Using CSP look-back techniques to solve exceptionally hard SAT instances. In Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, pp. 46-60, Cambridge, Mass. Available as: Springer Lecture Notes in Computer Science 1118.
4. Bayardo Jr, R. J., & Schrag, R. C. (1997). Using CSP look-back techniques to solve real-world SAT instances. In Proceedings of the Fourteenth National Conference on Artificial Intelligence, pp. 203-208, Providence, RI.
5. Bessière, C., & Régin, J.-C. (1996). MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems. In Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, pp. 61-75, Cambridge, Mass.
6. Bessière, C., & Régin, J.-C. (1997). Arc consistency for general constraint networks: Preliminary results. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, pp. 398-404, Nagoya, Japan.
7. Bruynooghe, M. (1981). Solving combinatorial search problems by intelligent backtracking. Information Processing Letters, 12, 36-39.
8. Chen, X. (2000). A Theoretical Comparison of Selected CSP Solving and Modeling Techniques. Ph.D. thesis, University of Alberta.
9. Dechter, R. (1990). Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition. Artificial Intelligence, 41, 273-312.
10. Dechter, R. (1992). Constraint networks. In Shapiro, S. C. (Ed.), Encyclopedia of Artificial Intelligence, 2nd Edition, pp. 276-285. John Wiley & Sons.
11. Freuder, E. C. (1978). Synthesizing constraint expressions. Comm. ACM, 21, 958-966.
12. Frost, D., & Dechter, R. (1994). Dead-end driven learning. In Proceedings of the Twelfth National Conference on Artificial Intelligence, pp. 294-300, Seattle, Wash.
13. Gaschnig, J. (1978). Experimental case studies of backtrack vs. Waltz-type vs. new algorithms for satisficing assignment problems. In Proceedings of the Second Canadian Conference on Artificial Intelligence, pp. 268-277, Toronto, Ont.
14. Haralick, R. M., & Elliott, G. L. (1980). Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14, 263-313.
15. Kautz, H., & Selman, B. (1992). Planning as satisfiability. In Proceedings of the 10th European Conference on Artificial Intelligence, pp. 359-363, Vienna.
16. Kondrak, G., & van Beek, P. (1997). A theoretical evaluation of selected backtracking algorithms. Artificial Intelligence, 89, 365-387.
17. Mackworth, A. K. (1977a). Consistency in networks of relations. Artificial Intelligence, 8, 99-118.
18. Mackworth, A. K. (1977b). On reading sketch maps. In Proceedings of the Fifth International Joint Conference on Artificial Intelligence, pp. 598-606, Cambridge, Mass.
19. McGregor, J. J. (1979). Relational consistency algorithms and their application in finding subgraph and graph isomorphisms. Inform. Sci., 19, 229-250.
20. Montanari, U. (1974). Networks of constraints: Fundamental properties and applications to picture processing. Inform. Sci., 7, 95-132.
21. Nadel, B. A. (1989). Constraint satisfaction algorithms. Computational Intelligence, 5, 188-224.
22. Prosser, P. (1993a). Domain filtering can degrade intelligent backtracking search. In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, pp. 262-267, Chambèry, France.
23. Prosser, P. (1993b). Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence, 9, 268-299.
24. Prosser, P. (1995). MAC-CBJ: Maintaining arc consistency with conflict-directed backjumping. Research report 177, University of Strathclyde.
25. Sabin, D., & Freuder, E. C. (1994). Contradicting conventional wisdom in constraint satisfaction. In Proceedings of the 11th European Conference on Artificial Intelligence, pp. 125-129, Amsterdam.
26. Schiex, T., & Verfaillie, G. (1994). Nogood recording for static and dynamic constraint satisfaction problems. International Journal on Artificial Intelligence Tools, 3, 1-15.
27. Sillito, J. (2000). Improving and Estimating the Cost of Backtracking Algorithms for CSPs.. MSc thesis, University of Alberta, 2000.
28. Smith, B. M., & Grant, S. A. (1995). Sparse constraint graphs and exceptionally hard problems. In Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, pp. 646-651, Montreal.
29. van Beek, P., & Chen, X. (1999). CPlan: A constraint programming approach to planning. In Proceedings of the Sixteenth National Conference on Artificial Intelligence, pp. 585-590, Orlando, Florida.