article

Relation Algebras and their Application in Temporal and Spatial Reasoning

Author:

Ivo DüntschAuthors Info & Claims

Artificial Intelligence Review, Volume 23, Issue 4

Pages 315 - 357

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

Published: 01 June 2005 Publication History

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.

References

[1]

Allen, J. F. (1983). Maintaining Knowledge About Temporal Intervals. Communications of the ACM 26 (11): 832-843.

Digital Library

[2]

Andréka, H., Düntsch, I. & Németi, I. (1995). Binary Relations and Permutation Groups. Mathematical Logic Quarterly 41 : 197-216.

[3]

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

[4]

Andréka, H. & Maddux, R. (1994). Representations for Small Relation Algebras. Notre Dame Journal of Formal Logic 35 (4): 550-562.

[5]

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.

[6]

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.

[7]

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 .

Digital Library

[8]

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.

[9]

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

[10]

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.

[11]

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 .

[12]

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

[13]

Chin, L. & Tarski, A. (1951). Distributive and Modular Laws in the Arithmetic of Relation Algebras. University of California Publications in Mathematics 1 : 341- 384.

[14]

Clarke, B. L. (1981). A Calculus of Individuals Based on 'Connection'. Notre Dame Journal of Formal Logic 22 : 204-218.

[15]

Comer, S. (1983). A Remark on Chromatic Polygroups. Congressus Numerantium 38 : 85-95.

[16]

de Laguna, T. (1922). Point, Line and Surface as Sets of Solids. The Journal of Philosophy 19 : 449-461.

[17]

de Morgan, A. (1864). On The Syllogism: IV, and on The Logic of Relations, Transactions of the Cambridge Philosophical Society 10 : 331-358. (read April 23, 1860).

[18]

Düntsch, I. (1991). Small Integral Relation Algebras generated by A Partial Order. Period. Math. Hungar . 23 : 129-138.

[19]

Düntsch, I. & Mikulás, S. (2001). Cylindric Structures and Dependencies in Relational Databases. Theoretical Computer Science 269 : 451-468.

[20]

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.

[21]

Düntsch, I., Schmidt, G. & Winter, M. (2001a). A Necessary Relation Algebra for Mereotopology. Studia Logica 69 : 381-409.

[22]

Düntsch, I., Wang, H. & McCloskey, S. (2001b). A Relation Algebraic Approach to the Region Connection Calculus. Theoretical Computer Science 255 : 63-83.

Digital Library

[23]

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

[24]

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

Digital Library

[25]

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 .

Digital Library

[26]

Egenhofer, M. (1993). A Model for Detailed Binary Topological Relationships. Geomatica 47 : 261-273.

[27]

Egenhofer, M. (1994a). Deriving the Composition of Binary Topological Relations. Journal of Visual Languages and Computing 5 :133 149.

[28]

Egenhofer, M. & Franzosa, R. (1991). Point-Set Topological Spatial Relations. International Journal of Geographic Information Systems 5 (2): 161-174.

[29]

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.

[30]

Egenhofer, M. J. (1994b). Deriving the Composition of Binary Topological Relations. Journal of Visual Languages and Computing 5 (1): 133-149.

[31]

Egenhofer, M. J., Clementini, E. & Felice, P. D. (1994). Topological Relations between Regions With Holes. International Journal of Geographical Information Systems 8 (2): 129-144.

[32]

Egenhofer, M. J. & Franzosa, R. D. (1995). On The Equivalence of Topological Relations. International Journal of Geographical Information Systems 9 (2): 133- 152.

[33]

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

Digital Library

[34]

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

[35]

Egenhofer, M. & Sharma, J. (1993). Assessing the Consistency of Complete and Incomplete Topological Information. Geographical Systems 1 : 47-68.

[36]

Frank, A. U. (1996). Qualitative Spatial Reasoning: Cardinal Directions as an Example. International Journal of Geographical Information Science 10 (3): 269- 290.

[37]

Gerla, G. (1995). Pointless Geometries. In Buekenhout, F. (ed.) Handbook of Incidence Geometry , chapter 18, pp. 1015-1031. Elsevier Science B.V.

[38]

Grzegorczyk, A. (1960). Axiomatization of Geometry Without Points. Synthese 12 : 228-235.

[39]

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

[40]

Hirsch, R. (1996). Relation Algebras of Intervals. Artificial Intelligence 83 (2): 267- 295.

Digital Library

[41]

Hirsch, R.: (1997). Expressive Power and Complexity in Algebraic Logic. Journal of Logic and Computation 7(3): 309-351.

[42]

Hirsch, R. (1999). A Finite Relation Algebra With An Undecidable Network Satisfaction Problem. Journal of the IGPL 7 : 547-554.

[43]

Hirsch, R. (2000). Tractable Approximations for Temporal Constraint Handling. Artificial Intelligence 116 (1-2): 287-295.

Digital Library

[44]

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

[45]

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

[46]

Jónsson, B. (1982). Varieties of Relation Algebras. Algebra Universalis 15 : 273-298.

[47]

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

[48]

Jonsson, P & Drakengren, T. (1997). A Complete Classification of Tractability in RCC-5. Journal of Artificial Intelligence Research 6 : 211-222.

[49]

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).

[50]

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

[51]

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

[52]

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

[53]

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

[54]

Ladkin, P. B. & Maddux, R. (1994). On Binary Constraint Problems. Journal of the ACM 41 (3): 435-469.

Digital Library

[55]

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

[56]

Ladkin, P. B. & Reinefeld, A. (1992). Effective Solution of Qualitative Interval Constraint Problems. Artificial Intelligence 57 (1): 105-124.

Digital Library

[57]

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.

Digital Library

[58]

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

[59]

Leśniewski, S. (1983). On The Foundation of Mathematics. Topoi 2 : 7-52.

[60]

Li, S. & Ying, M. (2003a). Extensionality of the RCC8 Composition Table. Fundamenta Informaticae 55 : 363-385.

Digital Library

[61]

Li, S. & Ying, M. (2003b). Region Connection Calculus: Its Models and Composition Table. Artificial Intelligence 145 : 121-145.

Digital Library

[62]

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

[63]

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

[64]

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

[65]

Lyndon, R. C. (1950). The Representation of Relational Algebras. Annals of Mathematics 51 (2): 707-729.

[66]

Lyndon, R. C. (1961). Relation Algebras and Projective Geometries. Michigan Mathematical Journal 8 : 21-28.

[67]

Mackworth, A. K. (1977). Consistency In Networks of Relations. Artificial Intelligence 8 (1): 99-118.

Digital Library

[68]

Maddux, R. (1982). Some Varieties Containing Relation Algebras. Transactions of the American Mathematical Society 272 : 501-526.

[69]

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

[70]

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.

[71]

Maddux, R. (1991b). The Origin of Relation Algebras in The Development and Axiomatization of The Calculus of Relations. Studia Logica 50 : 421-455.

[72]

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

Digital Library

[73]

McKenzie, R. (1970). Representations of Integral Relation Algebras. Michigan Mathematical Journal 17 : 279-287.

[74]

Monk, D. (1964). On Representable Relation Algebras. Michigan Mathematical Journal 11 : 207-210.

[75]

Montanari, U. (1974). Networks of Constraints: Fundamental Properties and Applications to Picture Processing. Information Sciences 7 : 95-132.

[76]

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

[77]

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.

Digital Library

[78]

Nebel, B. & Bürckert, H.-J. (1995). Reasoning About Temporal Relations: A Maximal Tractable Subclass of Allen's Interval Algebra. Journal of the ACM 42 (1): 43-66.

Digital Library

[79]

Németi, I. (1987). Decidability of Relation Algebras With Weakened Associativity. Proceedings of the American Mathematical Society 100 : 340-344.

[80]

Peirce, C. S. (1870). Description 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. Reprint by Welch, Bigelow and Co., Cambridge, Mass., 1870, pp. 1-62.

[81]

Pratt, I. & Schoop, D. (1998). A Complete Axiom System for Polygonal Mereotopology of The Real Plane. Journal of Philosophical Logic 27 (6): 621-658.

[82]

Pratt, I. & Schoop, D. (2000). Expressivity in Polygonal, Plane Mereotopology. Journal of Symbolic Logic 65 (2): 822-838.

[83]

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

[84]

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

Digital Library

[85]

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

Digital Library

[86]

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

Digital Library

[87]

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 .

[88]

Renz, J. & Nebel, B. (1999). On the Complexity of Qualitative Spatial Reasoning: A Maximal Tractable Fragment of The Region Connection Calculus, Artificial Intelligence 108 (1-2): 69-123.

Digital Library

[89]

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

[90]

Smith, T. P. & Park, K. K. (1992). An Algebraic Approach to Spatial Reasoning, International Journal of Geographical Information Systems 6 : 177-192.

[91]

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

[92]

Tarski, A. (1941). On the Calculus of Relations. Journal Symbolic Logic 6 : 73-89.

[93]

Tarski, A. (1955). Contributions to the Theory of Models. III. Indag. Math 17 : 56- 64.

[94]

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

[95]

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.

[96]

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

Cited By

Bodirsky MKnäuer S(2020)Hardness of Network Satisfaction for Relation Algebras with Normal RepresentationsRelational and Algebraic Methods in Computer Science10.1007/978-3-030-43520-2_3(31-46)Online publication date: 26-Oct-2020
https://dl.acm.org/doi/10.1007/978-3-030-43520-2_3
Bodirsky MJonsson P(2017)A model-theoretic view on qualitative constraint reasoningJournal of Artificial Intelligence Research10.5555/3176764.317677358:1(339-385)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.5555/3176764.3176773
Dylla FLee JMossakowski TSchneider TDelden AVen JWolter D(2017)A Survey of Qualitative Spatial and Temporal CalculiACM Computing Surveys10.1145/303892750:1(1-39)Online publication date: 4-Apr-2017
https://dl.acm.org/doi/10.1145/3038927
Show More Cited By

Index Terms

Relation Algebras and their Application in Temporal and Spatial Reasoning

Recommendations

Representability of Pairing Relation Algebras Representability of Pairing Relation Algebras Depends on our Ontology

We consider classes of relation algebras expanded with new operations based on the formation of ordered pairs. Examples for such algebras are pairing (or projection) algebras of algebraic logic and fork algebras of computer science. It is proved by Sain ...
Spatial and temporal reasoning: beyond Allen's calculus
Special issue on: Spatial and temporal reasoning

Many formalisms for qualitative spatial and temporal reasoning fit into a pattern exemplified by Allen's temporal interval calculus. Constraint-based reasoning using Allen's calculus can benefit from some of its main properties: (a) the underlying ...
Representability of Pairing Relation Algebras Representability of Pairing Relation Algebras Depends on our Ontology

We consider classes of relation algebras expanded with new operations based on the formation of ordered pairs. Examples for such algebras are pairing (or projection) algebras of algebraic logic and fork algebras of computer science. It is proved by Sain ...

Comments

Information & Contributors

Information

Published In

cover image Artificial Intelligence Review

Artificial Intelligence Review Volume 23, Issue 4

June 2005

102 pages

ISSN:0269-2821

Issue’s Table of Contents

Copyright © Copyright © 2005 Springer.

Publisher

Kluwer Academic Publishers

United States

Publication History

Published: 01 June 2005

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

24
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Bodirsky MKnäuer S(2020)Hardness of Network Satisfaction for Relation Algebras with Normal RepresentationsRelational and Algebraic Methods in Computer Science10.1007/978-3-030-43520-2_3(31-46)Online publication date: 26-Oct-2020
https://dl.acm.org/doi/10.1007/978-3-030-43520-2_3
Bodirsky MJonsson P(2017)A model-theoretic view on qualitative constraint reasoningJournal of Artificial Intelligence Research10.5555/3176764.317677358:1(339-385)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.5555/3176764.3176773
Dylla FLee JMossakowski TSchneider TDelden AVen JWolter D(2017)A Survey of Qualitative Spatial and Temporal CalculiACM Computing Surveys10.1145/303892750:1(1-39)Online publication date: 4-Apr-2017
https://dl.acm.org/doi/10.1145/3038927
Long ZSioutis MLi S(2016)Efficient path consistency algorithm for large qualitative constraint networksProceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence10.5555/3060621.3060788(1202-1208)Online publication date: 9-Jul-2016
https://dl.acm.org/doi/10.5555/3060621.3060788
Mossakowski TMoratz R(2015)Relations between spatial calculi about directions and orientationsJournal of Artificial Intelligence Research10.5555/2910557.291056554:1(277-308)Online publication date: 1-Sep-2015
https://dl.acm.org/doi/10.5555/2910557.2910565
Bodirsky MPinsker M(2015)Schaefer's Theorem for GraphsJournal of the ACM10.1145/276489962:3(1-52)Online publication date: 30-Jun-2015
https://dl.acm.org/doi/10.1145/2764899
Li SLong ZLiu WDuckham MBoth A(2015)On redundant topological constraintsArtificial Intelligence10.1016/j.artint.2015.03.010225:C(51-76)Online publication date: 1-Aug-2015
https://dl.acm.org/doi/10.1016/j.artint.2015.03.010
Inants AEuzenat J(2015)An Algebra of Qualitative Taxonomical Relations for Ontology AlignmentsThe Semantic Web - ISWC 201510.1007/978-3-319-25007-6_15(253-268)Online publication date: 11-Oct-2015
https://dl.acm.org/doi/10.1007/978-3-319-25007-6_15
Long ZLi S(2015)On Distributive Subalgebras of Qualitative Spatial and Temporal CalculiSpatial Information Theory10.1007/978-3-319-23374-1_17(354-374)Online publication date: 12-Oct-2015
https://dl.acm.org/doi/10.1007/978-3-319-23374-1_17
Wang SLiu DZhang CLiu D(2014)Representation, reasoning and similar matching for detailed topological relations with DTStringInformation Sciences: an International Journal10.1016/j.ins.2014.02.059276:C(255-277)Online publication date: 20-Aug-2014
https://dl.acm.org/doi/10.1016/j.ins.2014.02.059
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents