Skip to main content

Customizing Qualitative Spatial and Temporal Calculi

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4830))

Abstract

Qualitative spatial and temporal calculi are usually formulated on a particular level of granularity and with a particular domain of spatial or temporal entities. If the granularity or the domain of an existing calculus doesn’t match the requirements of an application, it is either possible to express all information using the given calculus or to customize the calculus. In this paper we distinguish the possible ways of customizing a spatial and temporal calculus and analyze when and how computational properties can be inherited from the original calculus. We present different algorithms for customizing calculi and proof techniques for analyzing their computational properties. We demonstrate our algorithms and techniques on the Interval Algebra for which we obtain some interesting results and observations. We close our paper with results from an empirical analysis which shows that customizing a calculus can lead to a considerably better reasoning performance than using the non-customized calculus.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Cohn, A.G., Renz, J.: Qualitative Spatial Representation and Reasoning. In: Van Hermelen, F., Lifschitz, V., Porter, B. (eds.) Handbook of Knowledge Representation, Elsevier, Amsterdam (2007)

    Google Scholar 

  2. Gerevini, A., Renz, J.: Combining topological and size information for spatial reasoning. Artificial Intelligence 137(1-2), 1–42 (2002)

    Article  MATH  MathSciNet  Google Scholar 

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

    Google Scholar 

  4. Renz, J., Nebel, B.: Efficient Methods for Qualitative Spatial Reasoning. Journal of Artificial Intelligence Research 15, 289–318 (2001)

    MATH  MathSciNet  Google Scholar 

  5. Ligozat, G., Renz, J.: What is a Qualitative Calculus? A General Framework. In: Zhang, C., Guesgen, H.W., Yeap, W.K. (eds.) PRICAI 2004. LNCS (LNAI), vol. 3157, pp. 53–64. Springer, Heidelberg (2004)

    Google Scholar 

  6. Krokhin, A., Jeavons, P., Jonsson, P.: Reasoning about temporal relations: The tractable subalgebras of Allen’s Interval Algebra. J. ACM 50(5), 591–640 (2003)

    Article  MathSciNet  Google Scholar 

  7. Allen, J.F.: Maintaining knowledge about temporal intervals. CACM 26(11), 832–843 (1983)

    MATH  Google Scholar 

  8. Nebel, B., Bürckert, H.J.: Reasoning about temporal relations: A maximal tractable subclass of Allen’s interval algebra. Journal of the ACM 42(1), 43–66 (1995)

    Article  MATH  Google Scholar 

  9. Golumbic, M.C., Shamir, R.: Complexity and algorithms for reasoning about time: A graph-theoretic approach. Journal of the ACM 40(5), 1128–1133 (1993)

    Article  MathSciNet  Google Scholar 

  10. Egenhofer, M.J.: Reasoning about binary topological relations. In: Günther, O., Schek, H.-J. (eds.) SSD 1991. LNCS, vol. 525, pp. 143–160. Springer, Heidelberg (1991)

    Google Scholar 

  11. Schaefer, M., Sedgwick, E., Stefankovic, D.: Recognizing string graphs in NP. Journal of Computer and System Sciences (2003)

    Google Scholar 

  12. Davis, E., Gotts, N.M., Cohn, A.G.: Constraint networks of topological relations and convexity. CONSTRAINTS 4(3), 241–280 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  13. Düntsch, I., Schmidt, G., Winter, M.: A necessary relation algebra for mereotopology. Studia Logica 69(3), 381–409 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  14. Renz, J., Ligozat, G.: Weak composition for qualitative spatial and temporal reasoning. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 534–548. Springer, Heidelberg (2005)

    Google Scholar 

  15. Renz, J.: A Spatial Odyssey of the Interval Algebra: 1.Directed Intervals. In: Proc. IJCAI 2001, pp. 51–56 (2001)

    Google Scholar 

  16. Nebel, B.: Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class. CONSTRAINTS 3(1), 175–190 (1997)

    Article  MathSciNet  Google Scholar 

  17. Cheeseman, P., Kanefsky, B., Taylor, W.M.: Where the really hard problems are. In: Proceedings of the 12th International Joint Conference on Artificial Intelligence, pp.331–337 (1991)

    Google Scholar 

  18. Renz, J.: Qulitative Spatial and Temporal Resoning: Efficient Algorithms for Everyone. In: IJCAI -2007. Proceedings of the 20th International Joint Conference on Artificial Intelligence, Hyderabad, India (January 2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Mehmet A. Orgun John Thornton

Rights and permissions

Reprints and permissions

Copyright information

© 2007 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Renz, J., Schmid, F. (2007). Customizing Qualitative Spatial and Temporal Calculi. In: Orgun, M.A., Thornton, J. (eds) AI 2007: Advances in Artificial Intelligence. AI 2007. Lecture Notes in Computer Science(), vol 4830. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-76928-6_31

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-76928-6_31

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-76926-2

  • Online ISBN: 978-3-540-76928-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics