# Relation Algebras for Reasoning about Time and Space

Conference paper

## Abstract

This paper presents a brief introduction to relation algebras, including some examples motivated by work in computer science, namely, the ‘interval algebras’, relation algebras that arose from James Allen’s work on temporal reasoning, and by ‘compass algebras’, which are designed for similar reasoning about space. One kind of reasoning problem, called a ‘constraint satisfaction problem’, can be defined for arbitrary relation algebras. It will be shown here that the constraint satisfiability problem is NP-complete for almost all compass and interval algebras.

## Keywords

Binary Relation Relative Product Constraint Satisfaction Problem Relation Algebra Algebraic Logic
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

## Preview

Unable to display preview. Download preview PDF.

## References

- [1]James F. Allen,
*An interval-based representation of temporal knowledge*.Proceedings of the Seventh International Joint Conference on Artificial Intelligence, (IJCAI), 1981, pp. 221–226.Google Scholar - [2]James F. Allen,
*Maintaining knowledge about temporal intervals*. Communications of the Association for Computing Machinery 26(11) (November 1983), 832–842.MATHCrossRefGoogle Scholar - [3]James F. Allen and Patrick J. Hayes,
*A commonsense theory of time*.Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), 1985, pp. 528–531.Google Scholar - [4]James F. Allen and Patrick J. Hayes,
*Moments and points in an interval-based temporal logic*, Tech. Report TR 180, Department of Computer Science, University of Rochester, December 1987.Google Scholar - [5]James F. Allen and Johannes A. Koomen,
*Planning using a temporal world model*, Proceedings of the Eighth International Joint Conference on Artificial Intelligence, Karlsruhe, W. Germany, August 1983 (IJCAI), 1983, pp. 741–747.Google Scholar - [6]George Boole,
*An investigation of the laws of thought on which are founded the mathematical theories of logic and probabilities*, Walton and Maberley, London, 1854.Google Scholar - [7]George Boole,
*The mathematical analysis of logic; being an essay towards a calculus of deductive reasoning*, B. Blackwell, Oxford, 1948, first published in London and Cambridge, 1847.Google Scholar - [8]Louise H. Chin and Alfred Tarski,
*Distributive and modular laws in the arithmetic of relation algebras*, University of California Publications in Mathematics, New Series 1 (1951), 341–384.Google Scholar - [9]Michael R. Garey and David S. Johnson,
*Computers and Intractibility*, A Guide to the Theory of NP-Completeness, W. H. Freeman, New York, 1979.Google Scholar - [10]Leon Henkin, J. Donald Monk, and Alfred Tarski,
*Cylindric Algebras, Part I*, North-Holland, Amsterdam, 1971.Google Scholar - [11]Leon Henkin, J. Donald Monk, and Alfred Tarski,
*Cylindric Algebras, Part II*, North-Holland, Amsterdam, 1985.Google Scholar - [12]Bjarni Jónsson,
*Varieties of relation algebras*, Algebra Universalis 15 (1982), 273–298.MATHGoogle Scholar - [13]Bjarni Jónsson,
*The theory of binary relations*, Algebraic Logic (Proc. Conf. Budapest 1988) (Amsterdam) (H. Andréka, J. D. Monk., and I. Németi, eds.), Colloq. Math. Soc. J. Bolyai, vol. 54, North-Holland, 1991, pp. 245–292.Google Scholar - [14]Bjarni Jonsson and Alfred Tarski,
*Boolean algebras with operators, Part II*, American Journal of Mathematics**74**(1952), 127–162.MATHMathSciNetCrossRefGoogle Scholar - [15]Peter B. Ladkin and Roger D. Maddux,
*Representation and reasoning with convex time intervals*, Tech. Report KES.U.88.2, Kestrel Institute, April 1988.Google Scholar - [16]Peter B. Ladkin and Roger D. Maddux,
*On binary constraint problems*, Tech. Report TR 102, Department of Computing Science and Mathematics, University of Stirling, April 1992, revised February 1993, to appear in the Journal of the Association for Computing Machinery.Google Scholar - [17]Peter B. Ladkin and Roger D. Maddux,
*On binary constraint networks*, Tech. Report KES.U.88.8, Kestrel Institute, November 1988.Google Scholar - [18]Roger C. Lyndon,
*The representation of relational algebras*, Annals of Mathematics (series 2)**51**(1950), 707–729.MATHGoogle Scholar - [19]Roger D. Maddux,
*Topics in Relation Algebras*, Ph.D. thesis, University of California, Berkeley, 1978, pp. iii+241.Google Scholar - [20]Roger D. Maddux,
*Some varieties containing relation algebras*, Transactions of the American Mathematical Society 272 (1982), 501–526.MATHMathSciNetCrossRefGoogle Scholar - [21]Roger D. Maddux,
*Finite integral relation algebras*, Universal Algebra and Lattice Theory, Springer-Verlag, 1985, Proceedings of the Southeastern Conference in Universal Algebra and Lattice Theory, Charleston, S.C., July 11–14, 1984, Lecture Notes in Mathematics 1149, pp. 175–197.Google Scholar - [22]Roger D. Maddux,
*Introductory course on relation algebras, finite-dimensional cylindric algebras, and their interconnections*, Algebraic Logic (Proc. Conf. Budapest 1988) (Amsterdam) (H. Andréka, J. D. Monk, and I. Németi, eds.), Colloq. Math. Soc. J. Bolyai, vol. 54, North-Holland, 1991, pp. 361–392.Google Scholar - [23]Roger D. Maddux,
*Pair-dense relation algebras*, Transactions of the American Mathematical Society**328**(1991), 83–131.MATHMathSciNetCrossRefGoogle Scholar - [24]Roger D. Maddux,
*The origin of relation algebras in the development and axiomatization of the calculus of relations*, Studia Logica**50**(3/4) (1991), 421–455.Google Scholar - [25]J. Malik and T. O. Binford,
*Reasoning in time and space*, Proceedings of the Eighth International Joint Conference on Artificial Intelligence, Karlsruhe, W. Germany, August 1983 (IJCAI), 1983, pp. 343–345.Google Scholar - [26]J. M. Martin,
*Dictionary of Philosophy and Psychology*, Macmillan & Co., New York, 1911, second edition.Google Scholar - [27]J. Donald Monk,
*On representable relation algebras*, Michigan Mathematical Journal 11 (1964), 207–210.MATHMathSciNetCrossRefGoogle Scholar - [28]Augustus De Morgan,
*On the symbols of logic, the theory of the syllogism, and in particular of the copula, and the application of the theory of probabilities to some questions in the theory of evidence*, Transactions of the Cambridge Philosophical Society**9**(1856), 79–127, reprinted in [30].Google Scholar - [29]Augustus De Morgan,
*On the syllogism, no, IV, and on the logic of relations*. Transactions of the Cambridge Philosophical Society**10**(1864), 331–358, reprinted in [30].Google Scholar - [30]Augustus De Morgan,
*On the Syllogism, and Other Logical Writings*, Yale University Press, New Haven, 1966, edited, with an Introduction by, Peter Heath.MATHGoogle Scholar - [31]Charles Sanders Peirce,
*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 (1870), 317–378, reprinted by Welch, Bigelow and Co., Cambridge, Mass., 1870, pp. 1-62; also reprinted in [33] and [34].CrossRefGoogle Scholar - [32]Charles Sanders Peirce,
*Note B: the logic of relatives*, Studies in Logic by Members of the Johns Hopkins University (Boston) (C. S. Peirce, ed.), Little, Brown, and Co., 1883, book reprinted, with an Introduction by Max H. Fisch and a Preface by Achim Eschbach, by John Benjamins Publishing Co., Amsterdam and Philadelphia, 1983, pp. lviii, vi+203; paper reprinted in [33], pp. 187–203.Google Scholar - [33]Charles Sanders Peirce,
*Collected Papers, Volume HI*, Harvard University Press, Cambridge, 1933, edited by Charles Hartshorne and Paul Weiss.Google Scholar - [34]Charles Sanders Peirce,
*Writings of Charles S. Peirce, A Chronological Edition*, Indiana University Press, Bloomington, 1984, edited by Edward C. Moore, Max H. Fisch, Christian J. W. Kloesel, Don D. Roberts, and Lynn A. Ziegler.Google Scholar - [35]F. W. K. Ernst Schroder,
*Vorlesungen über die Algebra der Logik (exacte Logik), Volume S, Algebra und Logik der Relative, part I*, second ed., Chelsea, Bronx, New York, 1966, first published in Leipzig, 1895.Google Scholar - [36]R G. Simmons,
*The use of quantitative and qualitative simulations*, Proceedings of Third National Conference on Artificial Intelligence (AAAI-83) Washington, D. C., August 1983, 1983.Google Scholar - [37]Alfred Tarski,
*On the calculus of relations*, The Journal of Symbolic Logic 6 (1941), 73–89.MATHMathSciNetCrossRefGoogle Scholar - [38]Alfred Tarski and Steven R. Givant,
*A Formalization of Set Theory without Variables*, Colloquium Publications, vol. 41, American Mathematical Society, 1987.Google Scholar - [39]P. G. van Beek,
*Reasoning about qualitative temporal information*, Proceedings of AAAI-90, the Eighth National Conference on Artificial Intelligence, AAAI Press, 1990, pp. 728–734.Google Scholar - [40]P. G. van Beek and R. Cohen,
*Approximation algorithms for temporal reasoning*, Proceedings of IJCAI89, the 11th Joint Conference on Artifical Intelligence, Morgan Kaufmann, 1989, short version of [41], pp. 1291–1296.Google Scholar - [41]P. G. van Beek and R. Cohen,
*Exact and approximate reasoning about temporal relations*, Computational Intelligence 6 (1990), 132–144, long version of [40].CrossRefGoogle Scholar - [42]J. F. A. K. van Benthem,
*The Logic of Time*, Reidel, 1983.Google Scholar - [43]M. Vilain and H. Kautz,
*Constraint propagation algorithms for temporal reasoning*, Proceedings of AAAI-86, Morgan Kaufmann, 1986, pp. 377–382.Google Scholar - [44]M. Vilain, H. Kautz, and P. G. van Beek,
*Constraint propagation algorithms for temporal reasoning*, Readings in Quantitative Reasoning About Physical Systems (Weld and de Kleer, eds.), Morgan Kaufmann, 1989, revised version of [43].Google Scholar - [45]Alfred North Whitehead and Bertrand Russell,
*Principia Mathematica, Volume I*, Cambridge University Press, Cambridge, England, 1910, Second edition, 1925.Google Scholar

## Copyright information

© British Computer Society 1994