Abstract
This paper deals with the problem of solving efficiently structured CSPs. It is well known that (hyper)tree-decompositions offer the best approaches from a theoretical viewpoint, but from the practical viewpoint, these methods do not offer efficient algorithms. Therefore, we introduce here a framework founded on coverings of CSP by acyclic hypergraphs. We study their properties and relations, and evaluate theoretically their interest with respect to the solving of structured problems. This framework does not define a new decomposition, but makes easier a dynamic management of the CSP structure during the search, and so an exploitation of dynamic variables ordering heuristics in the solving method. Thus, we provide a new complexity result which outperforms significantly the previous one given in the literature about heuristics for solving a decomposed problem. Finally, we present experimental results to assess the practical interest of these notions.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Rish, I., Dechter, R.: Resolution versus Search: Two Strategies for SAT. Journal of Automated Reasoning 24, 225–275 (2000)
Huang, J., Darwiche, A.: A structure-based variable ordering heuristic for SAT. In: Proceedings of IJCAI, pp. 1167–1172 (2003)
Li, W., van Beek, P.: Guiding Real-World SAT Solving with Dynamic Hypergraph Separator Decomposition. In: Proceedings of ICTAI, pp. 542–548 (2004)
Dechter, R., Pearl, J.: Tree-Clustering for Constraint Networks. Artificial Intelligence 38, 353–366 (1989)
Dechter, R.: Bucket Elimination: A Unifying Framework for Reasoning. Artificial Intelligence 113(1-2), 41–85 (1999)
Darwiche, A.: Recursive conditioning. Artificial Intelligence 126, 5–41 (2001)
Beeri, C., Fagin, R., Maier, D., Yannakakis, M.: On the desirability of acyclic database schemes. J. ACM 30, 479–513 (1983)
Gottlob, G., Leone, N., Scarcello, F.: Hypertree Decompositions and Tractable Queries. J. Comput. Syst. Sci. 64(3), 579–627 (2002)
Terrioux, C., Jégou, P.: Bounded backtracking for the valued constraint satisfaction problems. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 709–723. Springer, Heidelberg (2003)
de Givry, S., Schiex, T., Verfaillie, G.: Exploiting Tree Decomposition and Soft Local Consistency in Weighted CSP. In: Proceedings of AAAI, pp. 22–27 (2006)
Robertson, N., Seymour, P.D.: Graph minors II: Algorithmic aspects of tree-width. Algorithms 7, 309–322 (1986)
Gottlob, G., Leone, N., Scarcello, F.: A Comparison of Structural CSP Decomposition Methods. Artificial Intelligence 124, 282–343 (2000)
Cohen, D., Jeavons, P., Gyssens, M.: A Unified Theory of Structural Tractability for Constraint Satisfaction and Spread Cut Decomposition. In: Proc. of IJCAI, pp. 72–77 (2005)
Grohe, M., Marx, D.: Constraint solving via fractional edge covers. In: Proc. of SODA, pp. 289–298 (2006)
Jégou, P., Terrioux, C.: Hybrid backtracking bounded by tree-decomposition of constraint networks. Artificial Intelligence 146, 43–75 (2003)
Jégou, P., Terrioux, C.: Decomposition and good recording for solving Max-CSPs. In: Proc. of ECAI, pp. 196–200 (2004)
Marinescu, R., Dechter, R.: Dynamic Orderings for AND/OR Branch-and-Bound Search in Graphical Models. In: Proc. of ECAI, pp. 138–142 (2006)
Jégou, P., Ndiaye, S.N., Terrioux, C.: Dynamic Heuristics for Backtrack Search on Tree-Decomposition of CSPs. In: Proc. of IJCAI, pp. 112–117 (2007)
Dechter, R.: Constraint processing. Morgan Kaufmann, San Francisco (2003)
Sachenbacher, M., Williams, B.C.: Bounded Search and Symbolic Inference for Constraint Optimization. In: Proc. of IJCAI, pp. 286–291 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jégou, P., Ndiaye, S.N., Terrioux, C. (2007). Dynamic Management of Heuristics for Solving Structured CSPs. In: Bessière, C. (eds) Principles and Practice of Constraint Programming – CP 2007. CP 2007. Lecture Notes in Computer Science, vol 4741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74970-7_27
Download citation
DOI: https://doi.org/10.1007/978-3-540-74970-7_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74969-1
Online ISBN: 978-3-540-74970-7
eBook Packages: Computer ScienceComputer Science (R0)