Hybrid backtracking bounded by tree-decomposition of constraint networks

We propose a framework for solving CSPs based both on backtracking techniques and on the notion of tree-composition of the constraint networks. This mixed approach permits us to define a new framework for the enumeration, which we expect that it will benefit from the advantages of two approaches: a practical efficiency of enumerative algorithms and a warranty of a limited time complexity by an approximation of the tree-width of the constraint networks. Finally, experimental results allow us to show the advantages of this approach.