Abstract
Qualitative calculi play a central role in representing and reasoning about qualitative spatial and temporal knowledge. This paper studies distributive subalgebras of qualitative calculi, which are subalgebras in which (weak) composition distributives over nonempty intersections. The well-known subclass of convex interval relations is an example of distributive subalgebras. It has been proven for RCC5 and RCC8 that path consistent constraint network over a distributive subalgebra is always minimal and strongly n-consistent in a qualitative sense (weakly globally consistent). We show that the result also holds for the four popular qualitative calculi, i.e. Point Algebra, Interval Algebra, Cardinal Relation Algebra, and Rectangle Algebra. Moreover, this paper gives a characterisation of distributive subalgebras, which states that the intersection of a set of \(m\ge 3\) relations in the subalgebra is nonempty if and only if the intersection of every two of these relations is nonempty. We further compute and generate all maximal distributive subalgebras for those four qualitative calculi mentioned above. Lastly, we establish two nice properties which will play an important role in efficient reasoning with constraint networks involving a large number of variables.
Work supported by the Australian Research Council under DP120104159 and FT0990811.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
References
Allen, J.F.: Maintaining knowledge about temporal intervals. Commun. ACM 26(11), 832–843 (1983)
Amaneddine, N., Condotta, J.-F.: From path-consistency to global consistency in temporal qualitative constraint networks. In: Ramsay, A., Agre, G. (eds.) AIMSA 2012. LNCS, vol. 7557, pp. 152–161. Springer, Heidelberg (2012)
Balbiani, P., Condotta, J.F., Fariñas del Cerro, L.: A new tractable subclass of the rectangle algebra. In: IJCAI-99, pp. 442–447 (1999)
van Beek, P.: Approximation algorithms for temporal reasoning. In: IJCAI, pp. 1291–1296 (1989)
van Beek, P., Dechter, R.: On the minimality and global consistency of row-convex constraint networks. J. ACM 42, 543–561 (1995)
Bliek, C., Sam-Haroud, D.: Path consistency on triangulated constraint graphs. In: IJCAI-99, pp. 456–461 (1999)
Chandra, P., Pujari, A.K.: Minimality and convexity properties in spatial CSPs. In: ICTAI, pp. 589–593 (2005)
Chmeiss, A., Condotta, J.: Consistency of triangulated temporal qualitative constraint networks. In: ICTAI, pp. 799–802 (2011)
Danzer, L., Grünbaum, B., Klee, V.: Helly’s theorem and its relatives. In: Proceedings of the Seventh Symposium in Pure Mathematics of the American Mathematical Society (Convexity), pp. 101–179. American Mathematical Society Providence, RI (1963)
Deville, Y., Barette, O., Van Hentenryck, P.: Constraint satisfaction over connected row-convex constraints. Artif. Intell. 109(1), 243–271 (1999)
Duckham, M., Li, S., Liu, W., Long, Z.: On redundant topological constraints. In: KR-2014 (2014)
Düntsch, I.: Relation algebras and their application in temporal and spatial reasoning. Artif. Intell. Rev. 23(4), 315–357 (2005)
Düntsch, I., Wang, H., McCloskey, S.: A relation-algebraic approach to the region connection calculus. Theor. Comput. Sci. 255(1–2), 63–83 (2001)
Frank, A.U.: Qualitative spatial reasoning with cardinal directions. In: ÖGAI-91, pp. 157–167. Springer (1991)
Freksa, C.: Temporal reasoning based on semi-intervals. Artif. Intell. 54(1), 199–227 (1992)
Guesgen, H.W.: Spatial Reasoning Based on Allen’s Temporal Logic. International Computer Science Institute, Berkeley (1989)
Li, S., Long, Z., Liu, W., Duckham, M., Both, A.: On redundant topological constraints. Artif. Intell. 225, 51–78 (2015)
Li, S., Ying, M.: Region connection calculus: its models and composition table. Artif. Intell. 145(1–2), 121–146 (2003)
Ligozat, G.: Tractable relations in temporal reasoning: pre-convex relations. In: Proceedings of Workshop on Spatial and Temporal Reasoning, ECAI-94, pp. 99–108 (1994)
Ligozat, G.: Reasoning about cardinal directions. J. Vis. Lang. Comput. 9(1), 23–44 (1998)
Ligozat, G., Renz, J.: What is a qualitative calculus? a general framework. In: Zhang, C., W. Guesgen, H., Yeap, W.-K. (eds.) PRICAI 2004. LNCS (LNAI), vol. 3157, pp. 53–64. Springer, Heidelberg (2004)
Long, Z., Li, S.: On distributive subalgebras of qualitative spatial and temporal calculi. \(\text{ arXiv }:1506.00337\) [cs.AI] (2015). http://arxiv.org/abs/1506.00337
Montanari, U.: Networks of constraints: fundamental properties and applications to picture processing. Inf. Sci. 7, 95–132 (1974)
Nebel, B., Bürckert, H.J.: Reasoning about temporal relations: a maximal tractable subclass of Allen’s interval algebra. J. ACM 42(1), 43–66 (1995)
Randell, D.A., Cui, Z., Cohn, A.G.: A spatial logic based on regions and connection. In: KR-92, pp. 165–176 (1992)
Sioutis, M., Koubarakis, M.: Consistency of chordal RCC-8 networks. In: ICTAI, pp. 436–443 (2012)
Sioutis, M., Li, S., Condotta, J.F.: Efficiently characterizing non-redundant constraints in large real world qualitative spatial networks. In: IJCAI (2015, to appear)
Stell, J.G.: Boolean connection algebras: a new approach to the region-connection calculus. Artif. Intell. 122(1), 111–136 (2000)
Vilain, M.B., Kautz, H.A.: Constraint propagation algorithms for temporal reasoning. In: Proceedings of AAAI, pp. 377–382 (1986)
Zhang, Y., Freuder, E.C.: Properties of tree convex constraints. Artif. Intell. 172(12–13), 1605–1612 (2008)
Zhang, Y., Marisetti, S.: Solving connected row convex constraints by variable elimination. Artif. Intell. 173(12–13), 1204–1219 (2009)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Long, Z., Li, S. (2015). On Distributive Subalgebras of Qualitative Spatial and Temporal Calculi. In: Fabrikant, S., Raubal, M., Bertolotto, M., Davies, C., Freundschuh, S., Bell, S. (eds) Spatial Information Theory. COSIT 2015. Lecture Notes in Computer Science(), vol 9368. Springer, Cham. https://doi.org/10.1007/978-3-319-23374-1_17
Download citation
DOI: https://doi.org/10.1007/978-3-319-23374-1_17
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-23373-4
Online ISBN: 978-3-319-23374-1
eBook Packages: Computer ScienceComputer Science (R0)