Effective solution of qualitative interval constraint problems
Artificial Intelligence
Journal of the ACM (JACM)
Reasoning about temporal relations: a maximal tractable subclass of Allen's interval algebra
Journal of the ACM (JACM)
Relation algebras of intervals
Artificial Intelligence
Tractable approximations for temporal constraint handling
Artificial Intelligence
Maintaining knowledge about temporal intervals
Communications of the ACM
A relation — algebraic approach to the region connection calculus
Theoretical Computer Science
Fast algebraic methods for interval constraint problems
Annals of Mathematics and Artificial Intelligence
Relation algebras over containers and surfaces: An ontological study of a room space
Spatial Cognition and Computation
Relation Algebras for Reasoning about Time and Space
AMAST '93 Proceedings of the Third International Conference on Methodology and Software Technology: Algebraic Methodology and Software Technology
Maximal Tractable Fragments of the Region Connection Calculus: A Complete Analysis
IJCAI '99 Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence
Reasoning about Binary Topological Relations
SSD '91 Proceedings of the Second International Symposium on Advances in Spatial Databases
Computational Properties of Qualitative Spatial Reasoning: First Results
KI '95 Proceedings of the 19th Annual German Conference on Artificial Intelligence: Advances in Artificial Intelligence
Computing Transivity Tables: A Challenge For Automated Theorem Provers
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Region connection calculus: its models and composition table
Artificial Intelligence
Extensionality of the RCC8 composition table
Fundamenta Informaticae
Construction of Boolean contact algebras
AI Communications - Special issue on: Spatial and temporal reasoning
A complete classification of tractability in RCC-5
Journal of Artificial Intelligence Research
Toward a geometry of common sense: a semantics and a complete axiomatization of mereotopology
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
From images to bodies: modelling and exploiting spatial occlusion and motion parallax
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Determining the consistency of partial tree descriptions
Artificial Intelligence
Constraint Satisfaction Problems with Infinite Templates
Complexity of Constraints
Maximal infinite-valued constraint languages
Theoretical Computer Science
Combining binary constraint networks in qualitative reasoning
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
A fast algorithm and datalog inexpressibility for temporal reasoning
ACM Transactions on Computational Logic (TOCL)
Relational attribute systems II: reasoning with relations in information structures
Transactions on rough sets VII
The complexity of rooted phylogeny problems
Proceedings of the 13th International Conference on Database Theory
Proceedings of the forty-third annual ACM symposium on Theory of computing
Splitting atoms in relational algebras
RAMICS'11 Proceedings of the 12th international conference on Relational and algebraic methods in computer science
Datalog and constraint satisfaction with infinite templates
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Extensionality of the RCC8 Composition Table
Fundamenta Informaticae
Qualitative temporal and spatial reasoning revisited
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Maximal infinite-valued constraint languages
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
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 |
Qualitative temporal and spatial reasoning is in many cases based on binary relations such as before, after, starts, contains, contact, part of, and others derived from these by relational operators. The calculus of relation algebras is an equational formalism; it tells us which relations must exist, given several basic operations, such as Boolean operations on relations, relational composition and converse. Each equation in the calculus corresponds to a theorem, and, for a situation where there are only finitely many relations, one can construct a composition table which can serve as a look up table for the relations involved. Since the calculus handles relations, no knowledge about the concrete geometrical objects is necessary. In this sense, relational calculus is "pointless". Relation algebras were introduced into temporal reasoning by Allen (1983, Communications of the ACM 26(1), 832--843) and into spatial reasoning by Egenhofer and Sharma (1992, Fifth International Symposium on Spatial Data Handling, Charleston, SC). The calculus of relation algebras is also well suited to handle binary constraints as demonstrated e.g. by Ladkin and Maddux (1994, Journal of the ACM 41(3), 435--469). In the present paper I will give an introduction to relation algebras, and an overview of their role in qualitative temporal and spatial reasoning.