A sufficient condition for backtrack-bounded search
Journal of the ACM (JACM)
Constraint propagation algorithms for temporal reasoning: a revised report
Readings in qualitative reasoning about physical systems
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
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 complete classification of tractability in RCC-5
Journal of Artificial Intelligence Research
A comparison of structural CSP decomposition methods
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Maximal tractable fragments of the region connection calculus: a complete analysis
IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
The Point Algebra for Branching Time Revisited
KI '01 Proceedings of the Joint German/Austrian Conference on AI: Advances in Artificial Intelligence
Dependency calculus: reasoning in a general point relation algebra
KI'05 Proceedings of the 28th annual German conference on Advances in Artificial Intelligence
Hi-index | 0.00 |
The constraint satisfaction problem provides a natural framework for expressing many combinatorial problems. Since the general problem is NP-hard, an important question is how to restrict the problem to ensure tractability. The concept of independence has proven to be a useful method for constructing tractable constraint classes from existing classes. Since checking the independence property may be a difficult task, we provide a simple method for checking this property. Our method builds on a somewhat surprising connection between independence and refinements which is a recently established way of reducing one constraint satisfaction problem to another. Refinements have two interesting properties: (1) they preserve consistency; and (2) their correctness can be easily checked by a computer-assisted analysis. We show that all previous independence results of the point algebra for totally ordered and partially ordered time can be derived using this method. We also employ the method for deriving new tractable classes.