Complexity and algorithms for reasoning about time: a graph-theoretic approach
Journal of the ACM (JACM)
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
Combining topological and size information for spatial reasoning
Artificial Intelligence
Reasoning about Binary Topological Relations
SSD '91 Proceedings of the Second International Symposium on Advances in Spatial Databases
Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra
Journal of the ACM (JACM)
Recognizing string graphs in NP
Journal of Computer and System Sciences - STOC 2002
Efficient methods for qualitative spatial reasoning
Journal of Artificial Intelligence Research
Qualitative spatial and temporal reasoning: efficient algorithms for everyone
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Where the really hard problems are
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
A spatial odyssey of the interval algebra: 1. directed intervals
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
A condensed semantics for qualitative spatial reasoning about oriented straight line segments
Artificial Intelligence
Reasoning With Topological And Directional Spatial Information
Computational Intelligence
Spatial reasoning with rectangular cardinal relations
Annals of Mathematics and Artificial Intelligence
Hi-index | 0.00 |
Qualitative spatial and temporal calculi are usually formulated on a particular level of granularity and with a particular domain of spatial or temporal entities. If the granularity or the domain of an existing calculus doesn't match the requirements of an application, it is either possible to express all information using the given calculus or to customize the calculus. In this paper we distinguish the possible ways of customizing a spatial and temporal calculus and analyze when and how computational properties can be inherited from the original calculus. We present different algorithms for customizing calculi and proof techniques for analyzing their computational properties. We demonstrate our algorithms and techniques on the Interval Algebra for which we obtain some interesting results and observations. We close our paper with results from an empirical analysis which shows that customizing a calculus can lead to a considerably better reasoning performance than using the non-customized calculus.