Skip to main content

On Distributive Subalgebras of Qualitative Spatial and Temporal Calculi

  • Conference paper
  • First Online:
Spatial Information Theory (COSIT 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9368))

Included in the following conference series:

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.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    http://nuts.geovocab.org/.

References

  1. Allen, J.F.: Maintaining knowledge about temporal intervals. Commun. ACM 26(11), 832–843 (1983)

    Article  MATH  Google Scholar 

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

    Chapter  Google Scholar 

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

    Google Scholar 

  4. van Beek, P.: Approximation algorithms for temporal reasoning. In: IJCAI, pp. 1291–1296 (1989)

    Google Scholar 

  5. van Beek, P., Dechter, R.: On the minimality and global consistency of row-convex constraint networks. J. ACM 42, 543–561 (1995)

    Article  MATH  Google Scholar 

  6. Bliek, C., Sam-Haroud, D.: Path consistency on triangulated constraint graphs. In: IJCAI-99, pp. 456–461 (1999)

    Google Scholar 

  7. Chandra, P., Pujari, A.K.: Minimality and convexity properties in spatial CSPs. In: ICTAI, pp. 589–593 (2005)

    Google Scholar 

  8. Chmeiss, A., Condotta, J.: Consistency of triangulated temporal qualitative constraint networks. In: ICTAI, pp. 799–802 (2011)

    Google Scholar 

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

    Google Scholar 

  10. Deville, Y., Barette, O., Van Hentenryck, P.: Constraint satisfaction over connected row-convex constraints. Artif. Intell. 109(1), 243–271 (1999)

    Article  MATH  Google Scholar 

  11. Duckham, M., Li, S., Liu, W., Long, Z.: On redundant topological constraints. In: KR-2014 (2014)

    Google Scholar 

  12. Düntsch, I.: Relation algebras and their application in temporal and spatial reasoning. Artif. Intell. Rev. 23(4), 315–357 (2005)

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  14. Frank, A.U.: Qualitative spatial reasoning with cardinal directions. In: ÖGAI-91, pp. 157–167. Springer (1991)

    Google Scholar 

  15. Freksa, C.: Temporal reasoning based on semi-intervals. Artif. Intell. 54(1), 199–227 (1992)

    Article  MathSciNet  Google Scholar 

  16. Guesgen, H.W.: Spatial Reasoning Based on Allen’s Temporal Logic. International Computer Science Institute, Berkeley (1989)

    Google Scholar 

  17. Li, S., Long, Z., Liu, W., Duckham, M., Both, A.: On redundant topological constraints. Artif. Intell. 225, 51–78 (2015)

    Article  MathSciNet  Google Scholar 

  18. Li, S., Ying, M.: Region connection calculus: its models and composition table. Artif. Intell. 145(1–2), 121–146 (2003)

    Article  MathSciNet  MATH  Google Scholar 

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

    Google Scholar 

  20. Ligozat, G.: Reasoning about cardinal directions. J. Vis. Lang. Comput. 9(1), 23–44 (1998)

    Article  Google Scholar 

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

    Chapter  Google Scholar 

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

  23. Montanari, U.: Networks of constraints: fundamental properties and applications to picture processing. Inf. Sci. 7, 95–132 (1974)

    Article  MathSciNet  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  25. Randell, D.A., Cui, Z., Cohn, A.G.: A spatial logic based on regions and connection. In: KR-92, pp. 165–176 (1992)

    Google Scholar 

  26. Sioutis, M., Koubarakis, M.: Consistency of chordal RCC-8 networks. In: ICTAI, pp. 436–443 (2012)

    Google Scholar 

  27. Sioutis, M., Li, S., Condotta, J.F.: Efficiently characterizing non-redundant constraints in large real world qualitative spatial networks. In: IJCAI (2015, to appear)

    Google Scholar 

  28. Stell, J.G.: Boolean connection algebras: a new approach to the region-connection calculus. Artif. Intell. 122(1), 111–136 (2000)

    Article  MathSciNet  MATH  Google Scholar 

  29. Vilain, M.B., Kautz, H.A.: Constraint propagation algorithms for temporal reasoning. In: Proceedings of AAAI, pp. 377–382 (1986)

    Google Scholar 

  30. Zhang, Y., Freuder, E.C.: Properties of tree convex constraints. Artif. Intell. 172(12–13), 1605–1612 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  31. Zhang, Y., Marisetti, S.: Solving connected row convex constraints by variable elimination. Artif. Intell. 173(12–13), 1204–1219 (2009)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Sanjiang Li .

Editor information

Editors and Affiliations

Rights and permissions

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

Publish with us

Policies and ethics