Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra
Journal of the ACM (JACM)
Maintaining knowledge about temporal intervals
Communications of the ACM
Maximal Tractable Fragments of the Region Connection Calculus: A Complete Analysis
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Efficient methods for qualitative spatial reasoning
Journal of Artificial Intelligence Research
Ontology-driven geographic information integration: A survey of current approaches
Computers & Geosciences
Reasoning with lines in the Euclidean space
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Customizing qualitative spatial and temporal calculi
AI'07 Proceedings of the 20th Australian joint conference on Advances in artificial intelligence
Qualitative reasoning with directional relations
Artificial Intelligence
Reasoning about cardinal directions between extended objects: The NP-hardness result
Artificial Intelligence
Decomposition and tractability in qualitative spatial and temporal reasoning
Artificial Intelligence
Hi-index | 0.00 |
In the past years a lot of research effort has been put into finding tractable subsets of spatial and temporal calculi. It has been shown empirically that large tractable subsets of these calculi not only provide efficient algorithms for reasoning problems that can be expressed with relations contained in the tractable subsets, but also surprisingly efficient solutions to the general, NP-hard reasoning problems of the full calculi. An important step in this direction was the refinement algorithm which provides a heuristic for proving tractability of given subsets of relations. In this paper we extend the refinement algorithm and present a procedure which identifies large tractable subsets of spatial and temporal calculi automatically without any manual intervention and without the need for additional NP-hardness proofs. While we can only guarantee tractability of the resulting sets, our experiments show that for RCC8 and the Interval Algebra, our procedure automatically identifies all maximal tractable subsets. Using our procedure, other researchers and practitioners can automatically develop efficient reasoning algorithms for their spatial or temporal calculi without any theoretical knowledge about how to formally analyse these calculi.