Hybrid backtracking bounded by tree-decomposition of constraint networks

Artificial Intelligence

Volumn 146, Issue 1, 2003, Pages 43-75

  Jégou, Philippe ^a   Terrioux, Cyril ^a  

^a AIX MARSEILLE UNIVERSITY   (France)

Author keywords

Constraint networks; Empirical evaluation; Hybrid algorithms; Time space; Tree decomposition

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; PROBLEM SOLVING; TREES (MATHEMATICS);

HYBRID ALGORITHMS;

CONSTRAINT THEORY;

EID: 0037404962     PISSN: 00043702     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0004-3702(02)00400-9     Document Type: Article

References (36)

1. Arnborg S., Corneil D., Proskuroswki A. Complexity of finding embedding in a k -tree. SIAM J. Discrete Math. 8:1987;277-284.
2. Berry A. A wide-range efficient algorithm for minimal triangulation. Proceedings of SODA'99 SIAM Conference. 1999.
3. Becker A., Geiger D. A sufficiently fast algorithm for finding close to optimal clique trees. Artificial Intelligence. 125:2001;3-17.
4. Bayardo R.J., Miranker D.P. An optimal backtrack algorithm for tree-structured constraint satisfaction problems. Artificial Intelligence. 71:1994;159-181.
5. Bayardo R.J., Miranker D.P. A complexity analysis of space-bounded learning algorithms for the constraints satisfaction problem. Proceedings of 13th National Conference on Artificial Intelligence, Portland, OR. 1996;298-304.
6. Bayardo R., Pehoushek J. Counting models using connected components. Proceedings of AAAI 2000, Austin, TX. 2000;157-162.
7. Bessière C., Régin J.-C. MAC and combined heuristics: Two reasons to forsake FC (and CBJ?) on hard problems. Proceedings of CP'96. 1996;61-75.
8. Bessière C., Régin J.-C. Refining the basic constraint propagation algorithm. Proceedings of the 17th International Joint Conference on Artificial Intelligence, Seattle, WA. 2001;309-315.
9. Baget J.-F., Tognetti Y. Backtracking through biconnected components of a constraint graph. Proceedings of the 17th International Joint Conference on Artificial Intelligence, Seattle, WA. 2001;291-296.
10. Cabon C., de Givry S., Lobjois L., Schiex T., Warners J.P. Radio link frequency assignment. Constraints. 4:1999;79-89.
11. Chen X., van Beek P. Conflict-directed backjumping revisited. J. Artificial Intelligence Res. 14:2001;53-81.
12. Dechter R. Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition. Artificial Intelligence. 41:1990;273-312.
13. Dechter R., El Fattah Y. Topological parameters for time-space tradeoff. Artificial Intelligence. 125:2001;93-118.
14. Dechter R., Pearl J. The cycle-cutset method for improving search performance in AI applications. Proceedings of the Third IEEE on Artificial Intelligence Applications. 1987;224-230.
15. Dechter R., Pearl J. Tree-clustering for constraint networks. Artificial Intelligence. 38:1989;353-366.
16. Freuder E. A sufficient condition for backtrack-free search. J. ACM. 29:1982;24-32.
17. J. Gaschnig, Performance Measurement and Analysis of Certain Search Algorithms, Technical Report CMU-CS-79-124, Carnegie-Mellon University, 1979.
18. Ginsberg M. Dynamic backtracking. J. Artificial Intelligence Res. 1:1993;25-46.
19. Gottlob G., Leone N., Scarcello F. A comparison of structural CSP decomposition methods. Artificial Intelligence. 124:2000;282-343.
20. Golumbic M. Algorithmic Graph Theory and Perfect Graphs. 1980;Academic Press, New York.
21. Haralick R., Elliot G. Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence. 14:1980;263-313.
22. A. Koster, Frequency assignment - models and algorithms, PhD Thesis, University of Maastricht, November 1999.
23. Kondrak G., van Beek P. A theorical evaluation of selected backtracking algorithms. Artificial Intelligence. 89:1997;365-387.
24. Larrosa J. Boosting search with variable elimination. Proceedings of the 6th CP. 2000.
25. Mackworth A. Consistency in networks of relations. Artificial Intelligence. 8:1977;99-118.
26. Montanari U. Networks of constraints: Fundamental properties and applications to picture processing. Artificial Intelligence. 7:1974;95-132.
27. Nadel B. Tree search and arc consistency in constraint-satisfaction algorithms. Search in Artificial Intelligence. 1988;287-342 Springer, Berlin.
28. Prosser P. Hybrid algorithms for the constraint satisfaction problem. Comput. Intelligence. 9:1993;268-299.
29. Robertson N., Seymour P.D. Graph minors II: Algorithmic aspects of tree-width. Algorithms. 7:1986;309-322.
30. Rose D., Tarjan R., Lueker G. Algorithmic aspects of vertex elimination on graphs. SIAM J. Comput. 5:1976;266-283.
31. Sabin D., Freuder E. Contradicting conventional wisdom in constraint satisfaction. Proceedings of 11th ECAI. 1994;125-129.
32. Schiex T., Fargier H., Verfaillie G. Valued constraint satisfaction problems: Hard and easy problems. Proceedings of the 14th International Joint Conference on Artificial Intelligence, Montreal, Quebec. 1995;631-637.
33. Stallman R., Sussman G. Forward reasoning and dependency-directed backtracking in a system for computer-aided circuit analysis. Artificial Intelligence. 9:1977;135-196.
34. Schiex T., Verfaillie G. Nogood recording for static and dynamic constraint satisfaction problems. Internat. J. Artificial Intelligence Tools. 3:(2):1994;187-207.
35. Tarjan R., Yannakakis M. Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 13:(3):1984;566-579.
36. Verfaillie G., Lemâtre M., Schiex T. Russian doll search for solving constraint optimization problems. Proceedings of the 13th AAAI, Portland, OR. 1996;181-187.