Abstract
This paper deals with methods exploiting tree-decomposition approaches for solving constraint networks. We consider here the practical efficiency of these approaches by defining five classes of variable orders more and more dynamic which guarantee time complexity bounds from O(exp(w+1)) to O(exp(2(w+k))), with w the ”tree-width” of a CSP and k a constant. Finally, we assess practically their relevance.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dechter, R., Pearl, J.: Tree-Clustering for Constraint Networks. Artificial Intelligence 38, 353–366 (1989)
Gottlob, G., Leone, N., Scarcello, F.: A Comparison of Structural CSP Decomposition Methods. Artificial Intelligence 124, 243–282 (2000)
Robertson, N., Seymour, P.D.: Graph minors II: Algorithmic aspects of tree-width. Algorithms 7, 309–322 (1986)
Jégou, P., Ndiaye, S.N., Terrioux, C.: Computing and exploiting tree-decompositions for solving constraint networks. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 777–781. Springer, Heidelberg (2005)
Jégou, P., Terrioux, C.: Hybrid backtracking bounded by tree-decomposition of constraint networks. Artificial Intelligence 146, 43–75 (2003)
Gottlob, G., Hutle, M., Wotawa, F.: Combining hypertree, bicomp and hinge decomposition. In: Proceedings of ECAI, pp. 161–165 (2002)
Jégou, P., Ndiaye, S.N., Terrioux, C.: Strategies and heuristics for exploiting tree-decompositions of constraint networks. In: Proceedings of WIGSK (2006)
Smith, B.: The Phase Transition and the Mushy Region in Constraint Satisfaction Problems. In: Proceedings of ECAI, pp. 100–104 (1994)
Tarjan, R., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM Journal on Computing 13 (3), 566–579 (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jégou, P., Ndiaye, S.N., Terrioux, C. (2006). An Extension of Complexity Bounds and Dynamic Heuristics for Tree-Decompositions of CSP. In: Benhamou, F. (eds) Principles and Practice of Constraint Programming - CP 2006. CP 2006. Lecture Notes in Computer Science, vol 4204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889205_62
Download citation
DOI: https://doi.org/10.1007/11889205_62
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-46267-5
Online ISBN: 978-3-540-46268-2
eBook Packages: Computer ScienceComputer Science (R0)