A sufficient condition for backtrack-bounded search
Journal of the ACM (JACM)
Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Constraint satisfaction from a deductive viewpoint (Research Note)
Artificial Intelligence
Tree clustering for constraint networks (research note)
Artificial Intelligence
Easy problems for tree-decomposable graphs
Journal of Algorithms
Decomposing constraint satisfaction problems using database techniques
Artificial Intelligence
Closure properties of constraints
Journal of the ACM (JACM)
Hypertree decompositions and tractable queries
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Treewidth: Algorithmoc Techniques and Results
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
The Complexity of Acyclic Conjunctive Queries
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Theory of Relational Databases
Theory of Relational Databases
Query Evaluation via Tree-Decompositions
ICDT '01 Proceedings of the 8th International Conference on Database Theory
Hypergraphs in Model Checking: Acyclicity and Hypertree-Width versus Clique-Width
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Fixed-Parameter Complexity in AI and Nonmonotonic Reasoning
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Generalized Model-Checking Problems for First-Order Logic
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Constraint (Logic) Programming: A Survey on Research and Applications
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
A Constraint Directed Model for Partial Constraint Satisfaction Problems
AI '00 Proceedings of the 13th Biennial Conference of the Canadian Society on Computational Studies of Intelligence: Advances in Artificial Intelligence
Refinements and Independence: A Simple Method for Identifying Tractable Disjunctive Constraints
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
On Tractable Queries and Constraints
DEXA '99 Proceedings of the 10th International Conference on Database and Expert Systems Applications
A Logical Approach to Constraint Satisfaction
Complexity of Constraints
Partition-based logical reasoning for first-order and propositional theories
Artificial Intelligence - Special volume on reformulation
Unifying tree decompositions for reasoning in graphical models
Artificial Intelligence
Concurrently decomposable constraint systems
MATES'09 Proceedings of the 7th German conference on Multiagent system technologies
A greedy algorithm for constructing a low-width generalized hypertree decomposition
Proceedings of the 13th International Conference on Database Theory
Decomposing constraint systems: equivalences and computational properties
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Iterative join-graph propagation
UAI'02 Proceedings of the Eighteenth conference on Uncertainty in artificial intelligence
Journal of Computer and System Sciences
Systematic vs. non-systematic algorithms for solving the MPE task
UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
| Hi-index | 0.00 |
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 tractability criteria and compare the most relevant methods. We show that the method of hypertree decomposition dominates the others in the case of general (nonbinary) CSPs.