A sufficient condition for backtrack-bounded search
Journal of the ACM (JACM)
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra
Journal of the ACM (JACM)
On the minimality and global consistency of row-convex constraint networks
Journal of the ACM (JACM)
Tractable constraints on ordered domains
Artificial Intelligence
Constraint satisfaction over connected row-convex constraints
Artificial Intelligence
Building tractable disjunctive constraints
Journal of the ACM (JACM)
Maximal Tractable Fragments of the Region Connection Calculus: A Complete Analysis
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Disjunctive Temporal Reasoning in Partially Ordered Models of Time
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Towards a Complete Classification of Tractability in Point Algebras for Nonlinear Time
CP '99 Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming
A Comparison of Structural CSP Decomposition Methods
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
A complete classification of tractability in RCC-5
Journal of Artificial Intelligence Research
Point algebras for temporal reasoning: algorithms and complexity
Artificial Intelligence
IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume One
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
An important question in constraint satisfaction is how to restrict the problem to ensure tractability (since the general problem is NP-hard). The use of disjunctions has proven to be a useful method for constructing tractable constraint classes from existing classes; the well-known 'max-closed' and 'ORD-Horn' constraints are examples of tractable classes that can be constructed this way. Three sufficient conditions (the guaranteed satisfaction property, 1-independence and 2-independence) that each ensure the tractability of constraints combined by disjunctions have been proposed in the literature. We show that these conditions are both necessary and sufficient for tractability in three different natural classes of disjunctive constraints. This suggests that deciding this kind of property is a very important task when dealing with disjunctive constraints. We provide a simple, automatic method for checking the 1-independence property--this method is applicable whenever the consistency of the constraints under consideration can be decided by path-consistency. Our method builds on a connection between independence and refinements (which is a way of reducing one constraint satisfaction problem to another.)