Constraint propagation algorithms for temporal reasoning: a revised report
Readings in qualitative reasoning about physical systems
Journal of the ACM (JACM)
Relation algebras of intervals
Artificial Intelligence
From local to global consistency in temporal constraint networks
Theoretical Computer Science - Special issue: principles and practice of constraint programming
Local and global relational consistency
Theoretical Computer Science - Special issue: principles and practice of constraint programming
A shorter model theory
A Sufficient Condition for Backtrack-Free Search
Journal of the ACM (JACM)
Maintaining knowledge about temporal intervals
Communications of the ACM
Tractable disjunctions of linear constraints: basic results and applications to temporal reasoning
Theoretical Computer Science
Foundations of Databases: The Logical Level
Foundations of Databases: The Logical Level
The computational complexity of quantified constraint satisfaction
The computational complexity of quantified constraint satisfaction
Handbook of Temporal Reasoning in Artificial Intelligence (Foundations of Artificial Intelligence (Elsevier))
Relation Algebras and their Application in Temporal and Spatial Reasoning
Artificial Intelligence Review
Classifying the Complexity of Constraints Using Finite Algebras
SIAM Journal on Computing
Constraint Satisfaction with Countable Homogeneous Templates
Journal of Logic and Computation
Quantified Equality Constraints
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
A complete classification of tractability in RCC-5
Journal of Artificial Intelligence Research
Constraints, consistency and closure
Artificial Intelligence
Datalog and constraint satisfaction with infinite templates
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
The core of a countably categorical structure
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Quantified Positive Temporal Constraints
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
Tractable Quantified Constraint Satisfaction Problems over Positive Temporal Templates
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Constraint Satisfaction Problems with Infinite Templates
Complexity of Constraints
Theoretical Computer Science
Datalog and constraint satisfaction with infinite templates
Journal of Computer and System Sciences
Syntactically characterizing local-to-global consistency in ORD-Horn
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Hi-index | 0.00 |
Establishing local consistency is one of the main algorithmic techniques in temporal and spatial reasoning. In this area, one of the central questions for the various proposed temporal and spatial constraint languages is whether local consistency implies global consistency. Showing that a constraint language G has this "local-to-global" property implies polynomial-time tractability of the constraint language, and has further pleasant algorithmic consequences. In the present paper, we study the "local-to-global" property by making use of a recently established connection of this property with universal algebra. Specifically, the connection shows that this property is equivalent to the presence of a so-called quasi near-unanimity polymorphism of the constraint language. We obtain new algorithmic results and give very concise proofs of previously known theorems. Our results concern well-known and heavily studied formalisms such as the point algebra and its extensions, Allen's interval algebra, and the spatial reasoning language RCC-5.