Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Decomposing constraint satisfaction problems using database techniques
Artificial Intelligence
Tractable constraints on ordered domains
Artificial Intelligence
Closure properties of constraints
Journal of the ACM (JACM)
On the algebraic structure of combinatorial problems
Theoretical Computer Science
On the Desirability of Acyclic Database Schemes
Journal of the ACM (JACM)
A comparison of structural CSP decomposition methods
Artificial Intelligence
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Hypertree Decompositions: A Survey
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
An Algebraic Characterization of Tractable Constraints
COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
Theory of Relational Databases
Theory of Relational Databases
A unified theory of structural tractability for constraint satisfaction and spread cut decomposition
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination
Artificial Intelligence
Learning cluster-based structure to solve constraint satisfaction problems
Annals of Mathematics and Artificial Intelligence
| Hi-index | 0.00 |
The constraint satisfaction problem is in general NP-hard. As such, our aim is to identify tractable classes of constraint satisfaction problem instances (CSPs). Tractable classes of CSPs are normally described by limiting either the structure or the language of the CSPs. Structural decomposition methods identify CSPs whose reduction to the acyclic class is bound by a polynomial. These structural decompositions have been a very useful way to identify large tractable classes. However, these decomposition techniques have not yet been applied to relational tractability results. In this paper we introduce the notion of a typed guarded decomposition as a way to generalize the structural decompositions. We develop a no-promise algorithm which derives large new tractable classes of CSPs that are not describable as purely structural nor purely relational classes.