Graph minors. V. Excluding a planar graph
Journal of Combinatorial Theory Series B
Network-based heuristics for constraint-satisfaction problems
Artificial Intelligence
Tree clustering for constraint networks (research note)
Artificial Intelligence
Decomposing constraint satisfaction problems using database techniques
Artificial Intelligence
A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
Tractable constraints on ordered domains
Artificial Intelligence
Closure properties of constraints
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
Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Tractable conservative Constraint Satisfaction Problems
LICS '03 Proceedings of the 18th Annual IEEE Symposium on Logic in Computer Science
Classifying the Complexity of Constraints Using Finite Algebras
SIAM Journal on Computing
A dichotomy theorem for constraint satisfaction problems on a 3-element set
Journal of the ACM (JACM)
The complexity of homomorphism and constraint satisfaction problems seen from the other side
Journal of the ACM (JACM)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Perfect Constraints Are Tractable
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
An optimal coarse-grained arc consistency algorithm
Artificial Intelligence
Generalizing constraint satisfaction on trees: Hybrid tractability and variable elimination
Artificial Intelligence
Tractable hypergraph properties for constraint satisfaction and conjunctive queries
Proceedings of the forty-second ACM symposium on Theory of computing
Complexity of K-tree structured constraint satisfaction problems
AAAI'90 Proceedings of the eighth National conference on Artificial intelligence - Volume 1
Decomposition of domains based on the micro-structure of finite constraint-satisfaction problems
AAAI'93 Proceedings of the eleventh national conference on Artificial intelligence
Hybrid tractability of valued constraint problems
Artificial Intelligence
Hierarchically nested convex VCSP
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
The structure of tractable constraint satisfaction problems
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Persistency in maximum cardinality bipartite matchings
Operations Research Letters
Variable elimination in binary CSP via forbidden patterns
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
Hi-index | 0.00 |
The constraint satisfaction problem (CSP) is a general problem central to computer science and artificial intelligence. Although the CSP is NP-hard in general, considerable effort has been spent on identifying tractable subclasses. The main two approaches consider structural properties (restrictions on the hypergraph of constraint scopes) and relational properties (restrictions on the language of constraint relations). Recently, some authors have considered hybrid properties that restrict the constraint hypergraph and the relations simultaneously. Our key contribution is the novel concept of a CSP pattern and classes of problems defined by forbidden patterns (which can be viewed as forbidding generic sub-problems). We describe the theoretical framework which can be used to reason about classes of problems defined by forbidden patterns. We show that this framework generalises certain known hybrid tractable classes. Although we are not close to obtaining a complete characterisation concerning the tractability of general forbidden patterns, we prove a dichotomy in a special case: classes of problems that arise when we can only forbid binary negative patterns (generic subproblems in which only disallowed tuples are specified). In this case we show that all (finite sets of) forbidden patterns define either polynomial-time solvable or NP-complete classes of instances.