Computing and Exploiting Tree-Decompositions for Solving Constraint Networks

Methods exploiting tree-decompositions seem to provide the best approach for solving constraint networks w.r.t. the theoretical time complexity. However, they have not shown a real practical interest yet. In this paper, we study several methods for computing a rough optimal tree-decomposition and assess their relevance for solving CSPs.

• Type: Conference
• Year: 2005
• Where: CP
• Authors: Philippe Jégou, Samba Ndiaye, Cyril Terrioux
• Keywords: CP 2005, Methods Exploiting Tree-decompositions, Programming Languages, Rough Optimal Tree-decomposition, Theoretical Time Complexity