A comparison of structural CSP decomposition methods
نویسندگان
چکیده
منابع مشابه
A Comparison of Structural CSP Decomposition Methods
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. We introduce a framework for comparing parametric decomposition-based methods according to tractabi l...
متن کامل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...
متن کاملAn Empirical Comparison of CSP Decomposition Methods
We present an empirical comparison of decomposition techniques for CSPs. We compare three popular heuristics for tree decomposition and an exact method for optimal tree decomposition, along with two methods for hypertree decomposition. We use a small sample of instances in the experiments. We find that the connected hypertree decomposition method finds more optimal width decompositions than the...
متن کاملOn the Parallel Complexity of Struc- tural CSP Decomposition Methods
Constraint satisfaction problems are NP-complete in general, but they can be solved in polynomial time and also in parallel if their associated hypergraph is acyclic. It is often important for applications to solve also non-acyclic problems, thus finding larger tractable classes of CSPs is of high interest. Many structural decomposition methods have been suggested, which enable that the efficie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2000
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(00)00078-3