References

[1]. R. Maddux, The origin of relation algebras in the development and axiomatization of the calculus of relations. Studia Logica 3/4 (1991), pp. 421–455. View Record in Scopus | Cited By in Scopus (20)

[2]. I. Anellis and N. Houser, Nineteenth century roots of algebraic logic and universal algebra. In: H. Andréka, J. Monk and I. Németi, Editors, Algebraic LogicColloq. Math. Soc. J. Bolyai vol. 54, North-Holland, Amsterdam (1991), pp. 1–36.

[3]. J. Allen and J. Koomen, Planning using a temporal world model. In: Proc. IJCAI-83, Karsruhe, Germany, Morgan Kaufmann, San Mateo, CA (1983), pp. 711–714.

[4]. P. Ladkin and A. Reinefeld, A symbolic approach to interval constraint problems. Artificial Intelligence Symbol. Math. Comput. 737 (1993), pp. 65–84.

[5]. J. Allen, An interval-based representation of temporal knowledge. In: P.J. Hayes, Editor, Proc. IJCAI-81, Vancouver, BC, William Kaufmann (1981), pp. 221–226. View Record in Scopus | Cited By in Scopus (53)

[6]. J. Allen, Maintaining knowledge about temporal intervals. Comm. ACM 26 11 (1983), pp. 832–843. View Record in Scopus | Cited By in Scopus (1121)

[7]. J. Allen, Towards a general theory of action and time. Artificial Intelligence 23 2 (1984), pp. 123–154. Abstract | PDF (1565 K) | View Record in Scopus | Cited By in Scopus (413)

[8]. J. Allen and P. Hayes, A commonsense theory of time. In: A. Joshi, Editor, Proc. IJCAI-85, Los Angeles, CA, Morgan Kaufmann, San Mateo, CA (1985), pp. 528–531.

[9]. J. Allen and H. Kautz, A model of naïve temporal reasoning. In: J. Hobbs and R. Moore, Editors, Contributions to Artificial Intelligence, vol. 1, Ablex, Norwood, NJ (1983).

[10]. R. Dechter, I. Meiri and J. Pearl, Temporal constraint networks. Artificial Intelligence 49 (1991), pp. 61–95. Abstract | PDF (1690 K) | View Record in Scopus | Cited By in Scopus (350)

[11]. P. Ladkin and R. Maddux, On binary constraint problems. J. ACM 41 (1994), pp. 435–469. View Record in Scopus | Cited By in Scopus (0)

[12]. T. Dean and D. McDermott, Temporal database management. Artificial Intelligence 32 (1987), pp. 1–55. Abstract | PDF (3090 K) | View Record in Scopus | Cited By in Scopus (71)

[13]. F. Anger, D. Mitra and R. Rodriguez, Temporal constraint networks in nonlinear time. In: Workshop Notes of the Spatial and Temporal Reasoning at ECAI 98, Brighton, UK (1998).

[14]. F. Anger, D. Mitra and R. Rodriguez, Satisfiability in nonlinear time: Algorithms and complexity. In: Proc. Florida Artificial Intelligence Research Society Conference, Orlando, FL (1999).

[15]. B. Bennett, Determining consistency of topological relations. Constraints 3 2–3 (1998), pp. 213–225. View Record in Scopus | Cited By in Scopus (5)

[16]. M. Egenhofer, Reasoning about binary topological relations. In: O. Gunther and H.J. Schek, Editors, Advances in Spatial Databases-Second Symposium SSD'91, New YorkLecture Notes in Computer Science vol. 525, Springer, Berlin (1991), pp. 143–160.

[17]. A. Frank, Qualitative spatial reasoning about distances and directions. J. Visual Languages Comput. 3 4 (1992), pp. 343–371. Abstract | Article | PDF (1827 K) | View Record in Scopus | Cited By in Scopus (78)

[18]. A. Mackworth and C. Freuder, The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artificial Intelligence 25 1 (1985), pp. 65–74. Abstract | PDF (474 K) | View Record in Scopus | Cited By in Scopus (108)

[19]. M. Vilain and H. Kautz, Constraint propagation algorithms for temporal reasoning. In: Proc. AAAI-86, Philadelphia, PA (1986), pp. 377–382.

[20]. R. Valdés-Peréz, The satisfiability of temporal constraint networks. In: Proc. AAAI-87, Seattle, WA (1987), pp. 256–260.

[21]. M. Vilain, H. Kautz and P. van Beek, Constraint propagation algorithms for temporal reasoning—A revised report. In: D.S. Weld and J. de Kleer, Editors, Readings in Qualitative Reasoning about Physical Systems, Morgan Kaufmann, San Mateo, CA (1989), pp. 373–381.

[22]. E. Tsang, Foundations of Constraint Satisfaction. , Academic Press, New York (1993).

[23]. J. Lever and B. Richards, parcplan: A planning architecture with parallel actions, resources and constraints. In: Proc. ISMIS (1994).

[24]. R. Hirsch, Tractable approximations for temporal constraint handling. Artificial Intelligence 116 (2000), pp. 287–295. Abstract | PDF (97 K) | View Record in Scopus | Cited By in Scopus (2)

[25]. I. Düntsch, H. Wang and S. McCloskey, A relation algebraic approach to the region connection calculus. Theoret. Comput. Sci. 255 (2001), pp. 63–83. Abstract | PDF (164 K) | View Record in Scopus | Cited By in Scopus (30)

[26]. I. Düntsch, H. Wang and E. Orlowska, Algebras of approximating regions. Fund. Inform. 46 (2001), pp. 71–82. View Record in Scopus | Cited By in Scopus (8)

[27]. I. Düntsch, G. Schmidt and M. Winter, A necessary relation algebra for mereotopology. Studia Logica 69 (2001), pp. 381–409. View Record in Scopus | Cited By in Scopus (9)

[28]. M. Cristani, Many-sorted preference relations. In: F. Giunchiglia, D. Fensel, D. McGuiness and M. Williams, Editors, KR'02: Principles of Knowledge Representation and Reasoning, Morgan Kaufmann, San Mateo, CA (2002), pp. 265–276.

[29]. I. Düntsch, Small integral relation algebras generated by a partial order. Periodica Mathematica Hungarica 23 (1991), pp. 129–138. View Record in Scopus | Cited By in Scopus (5)

[30]. H. Andréka and R. Maddux, Representations for small relation algebras. Notre Dame J. Formal Logic 35 4 (1994), pp. 550–562.

[31]. R. Hirsch, Expressive power and complexity in algebraic logic. J. Logic Comput. 7 3 (1997), pp. 309–351. View Record in Scopus | Cited By in Scopus (12)

[32]. R. Hirsch, A relation algebra with undecidable network satisfaction problem. Bull. Interest Group Pure Appl. Logics 7 4 (1999), pp. 547–554.

[33]. T. Hrycej, A temporal extension of prolog. J. Logic Programming 15 (1993), pp. 113–145. Abstract | PDF (2582 K) | View Record in Scopus | Cited By in Scopus (13)

[34]. A. Tarski, On the calculus of relations. J. Symbolic Logic 6 (1941), pp. 73–89.

[35]. B. Jónsson and A. Tarski, Boolean algebras with operators II. Amer. J. Math. 74 (1952), pp. 127–162.

[36]. R. Hirsch and I. Hodkinson, Relation Algebras by Games. , North-Holland, Elsevier Science, Amsterdam (2002).

[37]. R. Maddux, Introductory course on relation algebras, finite-dimensional cylindric algebras, and their interconnections. In: H. Andréka, J. Monk and I. Németi, Editors, Algebraic LogicColloq. Math. Soc. J. Bolyai vol. 54, North-Holland, Amsterdam (1991), pp. 361–392.

[38]. R. Maddux, Relation algebras, in preparation

[39]. R. Karp, Reducibility among combinatorial problems. In: R. Miller and J. Thatcher, Editors, Complexity of Computer Computations, Plenum Press, New York (1972), pp. 85–103.

[40]. M. Garey and D. Johnson, Computers and Intractability—A Guide to the Theory of NP-completeness. , Freeman, New York (1979).

[41]. P. Ladkin and R. Maddux, On binary constraint problems. J. ACM 41 3 (1994), pp. 435–469. View Record in Scopus | Cited By in Scopus (68)

[42]. W. Hodges, Model theory. In: Encyclopedia of Mathematics and its Applications, second reprint, Cambridge University Press, Cambridge (1995).

[43]. P. Cameron, Oligomorphic Permutation Groups. London Math. Soc. Lecture Note Series vol. 152, Cambridge University Press, Cambridge (1990).

[44]. B. Nebel and H. Bürckert, Reasoning about temporal relations: A maximal tractable subclass of Allen's interval algebra. J. ACM 42 1 (1995), pp. 43–66. View Record in Scopus | Cited By in Scopus (102)

[45]. T. Drakengren and P. Jonsson, Maximal tractable subclasses of Allen's interval algebra: Preliminary report. In: Proc. AAAI-96, Portland, OR (1996), pp. 389–394. View Record in Scopus | Cited By in Scopus (1)

[46]. T. Drakengren and P. Jonsson, Twenty-one large tractable subclasses of Allen's algebra. Artificial Intelligence 93 1–2 (1997), pp. 297–319. Article | PDF (1621 K) | View Record in Scopus | Cited By in Scopus (14)

[47]. P. Jonsson, T. Drakengren and C. Bäckström, Computational complexity of relating time points with intervals. Artificial Intelligence 109 1–2 (1999), pp. 273–295. Abstract | PDF (190 K) | View Record in Scopus | Cited By in Scopus (13)

[48]. P. Jonsson and T. Drakengren, A complete classification of tractability in the spatial theory RCC-5. J. Artificial Intelligence Res. 6 (1997), pp. 211–221 Research Note . View Record in Scopus | Cited By in Scopus (19)

[49]. J. Renz and B. Nebel, On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus. Artificial Intelligence 108 1–2 (1999), pp. 69–123. Abstract | PDF (3640 K) | View Record in Scopus | Cited By in Scopus (74)

[50]. J. Renz, Maximal tractable fragments of the Region Connection Calculus: A complete analysis. In: Proc. IJCAI-99, Stockholm, Sweden (1999).

[51]. M. Cristani, The complexity of reasoning about spatial congruence. J. Artificial Intelligence Res. 11 (1999), pp. 361–390. View Record in Scopus | Cited By in Scopus (9)