Transition constraints: a study on the computational complexity of qualitative change
IJCAI'13 Proceedings of the Twenty-Third international joint conference on Artificial Intelligence
| Hi-index | 0.00 |
Establishing local consistency is one of the main algorithmic techniques in temporal and spatial reasoning. Acentral question for the various proposed temporal and spatial constraint languages is whether local consistency implies global consistency. Showing that a constraint language Γ has this ‘local-to-global’ property implies polynomial-time tractability of the constraint language, and has further pleasant algorithmic consequences. In the present article, we study the ‘local-to-global’ property by making use of a recently established connection of this property with universal algebra. Roughly speaking, the connection shows that this property is equivalent to the presence of a so-called quasi near-unanimity (QNU) 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, Allen's interval algebra and the spatial reasoning language RCC-5.