Skip to main content
SpringerLink
Log in

Relation Algebras and their Application in Temporal and Spatial Reasoning

  • Published:
Artificial Intelligence Review Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • JF Allen (1983) ArticleTitleMaintaining Knowledge About Temporal Intervals Communications of the ACM 26 IssueID11 832–843

    Google Scholar 

  • D Andréka N Düntsch I Németi (1995) ArticleTitleBinary Relations and Permutation Groups Mathematical Logic Quarterly 41 197 –216

    Google Scholar 

  • H. Andréka S. Givant I. Németi (1997) Decision Problems for Equational Theories of Relation Algebras , number 604 in Memoirs of the American Mathematical Society American Mathematical Society Providence, RI

    Google Scholar 

  • H Andréka R Maddux (1994) ArticleTitleRepresentations for Small Relation Algebras Notre Dame Journal of Formal Logic 35 IssueID4 550–562

    Google Scholar 

  • Andréka, H., Monk, J.D. & Németi, I. (eds.) (1991). Algebraic Logic, Vol. 54 of Colloquia Mathematica Societatis János Bolyai. North Holland: Amsterdam.

  • Anellis, I. & Houser, N. (1991). Nineteenth Century Roots of Algebraic Logic and Universal Algebra, In Andréka, H., Monk, J. D. Németi, I. (eds.), Algebraic Logic, Vol. 54 of Colloquia Mathematica Societatis Jénos Bolyai. North Holland: Amsterdam, 1--36.

  • Asher, N. & Vieu, L. (1995). Toward a Geometry of Common Sense: A Semantics and A Complete Axiomatization of Mereotopology. In Mellish, C. (ed.), IJCAI 95, Proceedings of the 14th International Joint Conference on Artificial Intelligence

  • Behnke, R., Berghammer, R., Meyer, E. & Schneider, P. (1998). RELVIEW–A System for Calculating with Relations and Relational Programming. Lecture Notes in Computer Science 1382 :318–321.

  • Bennett, B. (1994a). Some Observations and Puzzles About Composing Spatial and Temporal Relations. 11th European Conference on Artificial Intelligence, Workshop on Spatial Reasoning.

  • Bennett, B. (1994b). Spatial Reasoning with Propositional Logics. In Jon Doyle, P. T. & Erik Sandewall (ed.), Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning, Morgan Kaufmann, Bonn, FRG, 51--62.

  • Bennett, B., Isli, A. & Cohn, A. (1997). When Does a Composition Table Provide A Complete and Tractable Proof Procedure For A Relational Constraint Language?. IJCAI 97, Proceedings of the Workshop of Spatial Reasoning .

  • G. Birkhoff (1948) Lattice Theory , Vol.25 of American Mathematical Society Colloquium Publications EditionNumber2 Providence, MI AMS

    Google Scholar 

  • L. Chin A. Tarski (1951) ArticleTitleDistributive and Modular Laws in the Arithmetic of Relation Algebras University of California Publications in Mathematics 1 341–384

    Google Scholar 

  • B.L. Clarke (1981) ArticleTitleA Calculus of Individuals Based on ‘Connection’ Notre Dame Journal of Formal Logic 22 204–218

    Google Scholar 

  • S. Comer (1983) ArticleTitleA Remark on Chromatic Polygroups Congressus Numerantium 38 85–95

    Google Scholar 

  • T. deLaguna (1922) ArticleTitlePoint, Line and Surface as Sets of Solids The Journal of Philosophy 19 449–461

    Google Scholar 

  • A Morgan Particlede (1864) ArticleTitleOn The Syllogism: IV and on The Logic of Relations Transactions of the Cambridge Philosophical Society 10 331–358

    Google Scholar 

  • I. Düntsch (1991) ArticleTitleSmall Integral Relation Algebras generated by A Partial Order Period. Math. Hungar. 23 129–138

    Google Scholar 

  • I. Düntsch S. Mikulás (2001) ArticleTitleCylindric Structures and Dependencies in Relational Databases Theoretical Computer Science 269 451–468

    Google Scholar 

  • Düntsch, I., Orłowska, E. & Radzikowska, A. (2003). Lattice–Based Relation Algebras and Their Representability. Technical Report CS-03-03 , Department of Computer Science, Brock University.

  • I. Düntsch G. Schmidt M. Winter (2001a) ArticleTitleA Necessary Relation Algebra for Mereotopology Studia Logica 69 381–409

    Google Scholar 

  • I. Düntsch H. Wang S. McCloskey (2001b) ArticleTitleA Relation Algebraic Approach to the Region Connection Calculus Theoretical Computer Science 255 63–83

    Google Scholar 

  • Düntsch, I. & Winter, M. (2003). A Representation Theorem for Boolean Contact Algebras. Research Report CS-03-08 , Department of Computer Science, Brock University.

  • Düntsch, I. & Winter, M. (2004). Construction of Boolean contact algebras, AI Communications . To appear.

  • Egenhofer, M. (1991). Reasoning About Binary Topological Relations. In Gunther, O. & Schek, H. J. (eds.), Proceedings of the Second Symposium on Large Spatial Databases, SSD’91 (Zurich, Switzerland), 143–160, Vol. 525 of Lecture Notes in Computer Science.

  • M. Egenhofer (1993) ArticleTitleA Model for Detailed Binary Topological Relationships Geomatica 47 261–273

    Google Scholar 

  • M. Egenhofer (1994a) ArticleTitleDeriving the Composition of Binary Topological Relations Journal of Visual Languages and Computing 5 133–149

    Google Scholar 

  • M. Egenhofer R. Franzosa (1991) ArticleTitlePoint-Set Topological Spatial Relations International Journal of Geographic Information Systems 5 IssueID2 161–174

    Google Scholar 

  • Egenhofer, M. & Herring, J. (1991). Categorizing Binary Topological Relationships Between Regions, Lines and Points in Geographic Databases. Technical Report , Department of Surveying Engineering, University of Maine.

  • M.J. Egenhofer (1994b) ArticleTitleDeriving the Composition of Binary Topological Relations Journal of Visual Languages and Computing 5 IssueID1 133–149

    Google Scholar 

  • M.J. Egenhofer E. Clementini P.D. Felice (1994) ArticleTitleTopological Relations between Regions With Holes International Journal of Geographical Information Systems 8 IssueID2 129–144

    Google Scholar 

  • M.J. Egenhofer R.D. Franzosa (1995) ArticleTitleOn The Equivalence of Topological Relations International Journal of Geographical Information Systems 9 IssueID2 133–152

    Google Scholar 

  • M. Egenhofer A. Rodríguez (1999) ArticleTitleRelation Algebras Over Containers and Surfaces: An Ontological Study of a Room Space Journal of Spatial Cognition and Computation 1 155–180

    Google Scholar 

  • Egenhofer, M. & Sharma, J. (1992). Topological Consistency. Fifth International Symposium on Spatial Data Handling . Charleston, SC.

  • M. Egenhofer J. Sharma (1993) ArticleTitleAssessing the Consistency of Complete and Incomplete Topological Information Geographical Systems 1 47–68

    Google Scholar 

  • A.U. Frank (1996) ArticleTitleQualitative Spatial Reasoning: Cardinal Directions as an Example International Journal of Geographical Information Science 10 IssueID3 269–290

    Google Scholar 

  • Gerla 1995 gerla :pointless Gerla, G. (1995). Pointless Geometries. In Buekenhout, F. (ed.) Handbook of Incidence Geometry , chapter18, pp.1015–1031. Elsevier Science B.V.

  • A. Grzegorczyk (1960) ArticleTitleAxiomatization of Geometry Without Points Synthese 12 228–235

    Google Scholar 

  • L. Henkin J.D. Monk A. Tarski (1985) Cylindric Algebras Amsterdam Part II , North Holland

    Google Scholar 

  • R. Hirsch (1996) ArticleTitleRelation Algebras of Intervals Artificial Intelligence 83 IssueID2 267–295

    Google Scholar 

  • R. Hirsch (1997) ArticleTitleExpressive Power and Complexity in Algebraic Logic. Journal of Logic and Computation 7 IssueID3 309–351

    Google Scholar 

  • R. Hirsch (1999) ArticleTitleA Finite Relation Algebra With An Undecidable Network Satisfaction Problem Journal of the IGPL 7 547–554

    Google Scholar 

  • R. Hirsch (2000) ArticleTitleTractable Approximations for Temporal Constraint Handling Artificial Intelligence 116 IssueID1–2 287–295

    Google Scholar 

  • Hirsch, R. & Hodkinson, I. (2002). Relation Algebras by Games, Vol. 147 of Studies in Logic and the Foundations of Mathematics. Elsevier: Amsterdam.

  • B. Jónsson (1959) ArticleTitleRepresentation of Modular Lattices and of Relation Algebras Transaction of the American Mathematical Society: Providence, RI. 92 449–464

    Google Scholar 

  • B. Jónsson (1982) ArticleTitleVarieties of Relation Algebras Algebra Universalis 15 273–298

    Google Scholar 

  • Jónsson, B. (1984). The Theory of Binary Relations. Lecture notes, University of Montreal.

  • P. Jonsson T. Drakengren (1997) ArticleTitleA Complete Classification of Tractability in RCC -5 Journal of Artificial Intelligence Research 6 211–222

    Google Scholar 

  • Kahl, W. & Schmidt, G. (2000). Exploring (finite) Relation Algebras using Tools written in Haskell. Technical Report 2000--02, Fakultät für Informatik, Universität der Bundeswehr München. Avalaible from http://ist.unibw-muenchen.de/Publications/TR/2000-02/ (December 31, 2001).

  • Köhler, C. (2002). The Occlusion Calculus. Proceedings of the ‘‘Cognitive Vision’’ Workshop , Zürich.

  • Koppelberg, S. (1989). General Theory of Boolean Algebras, Vol. 1 of Handbook on Boolean Algebras. North Holland: Amsterdam.

  • Kurucz, Á. (1997). Decision Problems in Algebraic Logic. PhD Thesis, Hungarian Academy of Sciences, Budapest.

  • Ladkin, P.B. & Maddux, R. (1988). The Algebra of Binary Constraint Networks. Technical Report KES.U.88.9, Kestrel Institute. http://www.math.iastate.edu/maddux/papers/tabcn.ps.

  • P.B. Ladkin R. Maddux (1994) ArticleTitleOn Binary Constraint Problems Journal of the ACM 41 IssueID3 435–469

    Google Scholar 

  • Ladkin, P.B. & Maddux, R.D. (1989). On Binary Constraint Networks. Technical report , Kestrel Institute, Palo Alto, CA, USA.

  • P.B. Ladkin A. Reinefeld (1992) ArticleTitleEffective Solution of Qualitative Interval Constraint Problems Artificial Intelligence 57 IssueID1 105–124

    Google Scholar 

  • Ladkin, P.B. & Reinefeld, A. (1997). Fast Algebraic Methods for Interval Constraint Problems. Annals of Mathematics and Artificial Intelligence 19(3--4): 383--411. URL: citeseer.nj.nec.com/article/ladkin97fast.html

  • Leśniewski, S. (1927–1931). O Podstawach Matematyki. Przeglad Filozoficzny 30–34 .

  • S. Leśniewski (1983) ArticleTitleOn The Foundation of Mathematics Topoi 2 7–52

    Google Scholar 

  • S. Li M. Ying (2003a) ArticleTitleExtensionality of the RCC8 Composition Table Fundamenta Informaticae 55 363–385

    Google Scholar 

  • S. Li M. Ying (2003b) ArticleTitleRegion Connection Calculus: Its Models and Composition Table Artificial Intelligence 145 121–145

    Google Scholar 

  • Li, Y., Li, S. & Ying, M. (2003). Relational Reasoning in The Region Connection Calculus. (Preprint).

  • Lobachevskij, N.I. (1835). New Principles of Geometry With A Complete Theory of Parallels. Polnoe Sobranie Socinenij 2 . (In Russian).

  • Luschei, E.C. (1962). The Logical Systems of Leśniewski . North Holland, Amsterdam.

  • R.C. Lyndon (1950) ArticleTitleThe Representation of Relational Algebras Annals of Mathematics 51 IssueID2 707–729

    Google Scholar 

  • R.C. Lyndon (1961) ArticleTitleRelation Algebras and Projective Geometries Michigan Mathematical Journal 8 21–28

    Google Scholar 

  • A.K. Mackworth (1977) ArticleTitleConsistency In Networks of Relations Artificial Intelligence 8 IssueID1 99–118

    Google Scholar 

  • R. Maddux (1982) ArticleTitleSome Varieties Containing Relation Algebras Transactions of the American Mathematical Society 272 501–526

    Google Scholar 

  • Maddux, R. (1990). Some Algebras and Algorithms for Reasoning About Time and Space. ftp://ftp.math.iastate.edu/pub/maddux/cmps4.ps.

  • Maddux, R. (1991a). Introductory Course on Relation Algebras, Finite-Dimensional Cylindric Algebras, and Their Interconnections. In Andréka, H., Monk, J.D. & Németi, I. (eds.). Algebraic Logic, vol. 54 of Colloquia Mathematica Societatis János Bolyai. North Holland: Amsterdam, pp. 361--392.

  • R. Maddux (1991b) ArticleTitleThe Origin of Relation Algebras in The Development and Axiomatization of The Calculus of Relations Studia Logica 50 421–455

    Google Scholar 

  • R Maddux (1993) Relation Algebras for Reasoning About Time and Space M Nivat C Rattray T Rus G Scollo (Eds) Algebraic Methodology and Software Technology (AMAST ‘93) Workshops in Computing Springer-Verlag New York, NY 27–44

    Google Scholar 

  • R. McKenzie (1970) ArticleTitleRepresentations of Integral Relation Algebras Michigan Mathematical Journal 17 279–287

    Google Scholar 

  • D. Monk (1964) ArticleTitleOn Representable Relation Algebras Michigan Mathematical Journal 11 207–210

    Google Scholar 

  • U. Montanari (1974) ArticleTitleNetworks of Constraints: Fundamental Properties and Applications to Picture Processing Information Sciences 7 95–132

    Google Scholar 

  • Mormann, T. (2001). Holes in The Region Connection Calculus. Preprint, Presented at RelMiCS 6, Oisterwijk, October 2001.

  • Nebel, B. (1995). Computational Properties of Qualitative Spatial Reasoning: First Results, In Wachsmuth, I. Rollinger, C.-R. and Brauer, W. (eds.) KI-95: Advances in Artificial Intelligence, 233--244, Vol. 981 of Lecture Notes in Computer Science, Springer, Heidelberg.

  • B. Nebel H.-J. Bürckert (1995) ArticleTitleReasoning About Temporal Relations: A Maximal Tractable Subclass of Allen’s Interval Algebra Journal of the ACM 42 IssueID1 43–66

    Google Scholar 

  • I. Németi (1987) ArticleTitleDecidability of Relation Algebras With Weakened Associativity Proceedings of the American Mathematical Society 100 340–344

    Google Scholar 

  • C. S. Peirce (1870) ArticleTitleDescription of A Notation for The Logic of Relatives, Resulting from An Amplification of The Conceptions of Boole’s Calculus of Logic Memoirs of the American Academy of Sciences 9 317–378

    Google Scholar 

  • I. Pratt D. Schoop (1998) ArticleTitleA Complete Axiom System for Polygonal Mereotopology of The Real Plane Journal of Philosophical Logic 27 IssueID6 621–658

    Google Scholar 

  • I. Pratt D. Schoop (2000) ArticleTitleExpressivity in Polygonal, Plane Mereotopology Journal of Symbolic Logic 65 IssueID2 822–838

    Google Scholar 

  • V. Pratt (1992) Origins of The Calculus of Binary Relations, 7th Annual Symposium on Logic in Computer Science IEEE Santa Cruz, CA 248–254

    Google Scholar 

  • D.A. Randell A.G. Cohn Z. Cui (1992) Computing Transitivity tables: A Challenge for Automated Theorem Provers D. Kapur (Eds) Proceedings of the 11th International Conference on Automated Deduction ( CADE -11) , Vol Springer Saratoga Springs, NY 786–790

    Google Scholar 

  • D. Randell M. Witkowski M. Shanahan (2001) From Images to Bodies: Modelling and Exploiting Spatial Occlusion and Motion Parallax B. Nebel (Eds) Proceedings of the seventeenth International Conference on Artificial Intelligence ( IJCAI -01) , 57–66 San Francisco, CA Morgan Kaufmann Publishers, Inc

    Google Scholar 

  • J. Renz (1999) Maximal Tractable Fragments of The Region Connection Calculus: A Complete Analysis D. Thomas (Eds) Proceedings of the 16th International Joint Conference on Artificial Intelligence ( IJCAI -99- Vol1) , 448–455 San Francisco, CA Morgan Kaufmann Publishers, Inc

    Google Scholar 

  • Renz, J. & Nebel, B. (1997). On the Complexity of Qualitative Spatial Reasoning: A Maximal Tractable Fragment of The Region Connection Calculus. IJCAI 97, Proceedings of the 15th International Joint Conference on Artificial Intelligence.

  • J. Renz B. Nebel (1999) ArticleTitleOn the Complexity of Qualitative Spatial Reasoning: A Maximal Tractable Fragment of The Region Connection Calculus Artificial Intelligence 108 IssueID1–2 69–123

    Google Scholar 

  • Schröder, E. (1890–1905). Vorlesungenüber die Algebra der Logik , Volumes 1 to 3 , Teubner, Leipzig. Reprinted by Chelsea, New York, 1966.

  • T.P. Smith K.K. Park (1992) ArticleTitleAn Algebraic Approach to Spatial Reasoning International Journal of Geographical Information Systems 6 177–192

    Google Scholar 

  • Surma, S.J., Srzednicki, J.T., Barnett, D.I. and Ricky, V.F. (eds.) (1992). Stanis law Leśniewski: Collected works

  • A. Tarski (1941) ArticleTitleOn the Calculus of Relations Journal Symbolic Logic 6 73–89

    Google Scholar 

  • A. Tarski (1955) ArticleTitleContributions to the Theory of Models III . Indag. Math 17 56–64

    Google Scholar 

  • A. Tarski S. Givant (1987) A Formalization of Set Theory Without Variables Vol.41 of Colloquium Publications American Mathematical Society Providence, RI

    Google Scholar 

  • Vilain, M., Kautz, H. & van Beek, P. (1986). Constraint Propagation Algorithms For Temporal Reasoning: A Revised Report. Proceedings of the Fifth National Conference on Artificial Intelligence, 377--382. American Association for Artificial Intelligence. AAAI Press: Menlo Park.

  • A.N. Whitehead (1929) Process and Reality New York MacMillan

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Brock University, St. Catharines, Ontario, L2S 3A1, Canada

    Ivo Düntsch

Authors
  1. Ivo Düntsch
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ivo Düntsch.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Düntsch, I. Relation Algebras and their Application in Temporal and Spatial Reasoning. Artif Intell Rev 23, 315–357 (2005). https://doi.org/10.1007/s10462-004-5899-8

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10462-004-5899-8

Keywords

Search

Navigation