New Structural Decomposition Techniques for Constraint Satisfaction Problems
نویسندگان
چکیده
We propose four new structural decomposition techniques for Constraint Satisfaction Problems. We compare these four techniques both theoretically and experimentally with hinge decomposition and hypertree decomposition. Our experiments show that one of our techniques offers the best trade-off between the computational cost of the decomposition and the width of the resulting decomposition tree.
منابع مشابه
Cut-and-Traverse: A New Structural Decomposition Strategy for Finite Constraint Satisfaction Problems
In this paper, we propose a new heuristic structural decomposition strategy for Constraint Satisfaction Problems (CSPs), called Cut-and-Traverse (CAT) decomposition. This method has three steps: cutting step, traversing step and combining step. In the first step, cutting step, we gradually decompose the structure of a CSP instance to multiple partitions by finding independent cuts in a given CS...
متن کاملA unified theory of structural tractability for constraint satisfaction problems
In this paper we derive a generic form of structural decomposition for the constraint satisfaction problem, which we call a guarded decomposition. We show that many existing decomposition methods can be characterised in terms of finding guarded decompositions satisfying certain specified additional conditions. Using the guarded decomposition framework we are also able to define a new form of de...
متن کاملDecomposing Constraint Satisfaction Problems Using Database Techniques
There is a very close relationship between constraint satisfaction problems and the satisfaction of join-dependencies in a relational database which is due to a common underlying structure, namely a hypergraph. By making that relationship explicit we are able to adapt techniques previously developed for the study of relational databases to obtain new results for constraint satisfaction problems...
متن کاملBounded Backtracking for the Valued Constraint Satisfaction Problems
We propose a new method for solving Valued Constraint Satisfaction Problems based both on backtracking techniques branch and bound and the notion of tree-decomposition of valued constraint networks. This mixed method aims to benefit from the practical efficiency of enumerative algorithms while providing a warranty of a bounded time complexity. Indeed the time complexity of our method is O(d ++1...
متن کاملA Comparison of Structural CSP Decomposition
We compare tractable classes of constraint satisfaction problems (CSPs). We first give a uniform presentation of the major structural CSP decomposition methods. We then introduce a new class of tractable CSPs based on the concept of hypertree decomposition recently developed in Database Theory, and analyze the cost of solving CSPs having bounded hypertree-width. We provide a framework for compa...
متن کامل