Skip to main content

Qualitative Direction Calculi with Arbitrary Granularity

  • Conference paper
PRICAI 2004: Trends in Artificial Intelligence (PRICAI 2004)

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

Included in the following conference series:

Abstract

Binary direction relations between points in two-dimensional space are the basis to any qualitative direction calculus. Previous calculi are only on a very low level of granularity. In this paper we propose a generalization of previous approaches which enables qualitative calculi with an arbitrary level of granularity. The resulting calculi are so powerful that they can even emulate a quantitative representation based on a coordinate system. We also propose a less powerful, purely qualitative version of the generalized calculus. We identify tractable subsets of the generalized calculus and describe some applications for which these calculi are useful.

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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Chvatal, V.: Linear Programming. W.H. Freeman and Company, New York (1983)

    MATH  Google Scholar 

  2. Conn, A.G., Hazarika, S.M.: Qualitative Spatial Representation and Reasoning: An Overview. Fundamenta Informaticae 46(1-2), 1–29 (2001)

    MathSciNet  Google Scholar 

  3. Diintscli, I., Wang, H., McCloskey, S.: A relation algebraic approach to the Region Connection Calculus. Theoretical Computer Science 255, 63–83 (2001)

    Article  MathSciNet  Google Scholar 

  4. Prank, A.: Qualitative spatial reasoning about cardinal directions. In: Proc. ACAI 1991, pp. 157–167 (1991)

    Google Scholar 

  5. Ligozat, G.: A new proof of tractability for Ord-Horn relations. In: Proc. AAAI 1996, pp. 715–720 (1996)

    Google Scholar 

  6. Ligozat, G.: Reasoning about eaidinal directions. J. of Vis. Lttiijiitagex & Computing 9, 23–44 (1998)

    Article  Google Scholar 

  7. Mackworth, A.K.: Consistency in networks of relations. Artificial Intelligence 8, 99–118 (1977)

    Article  MATH  Google Scholar 

  8. Mitra, D.: Qualitative reasoning with arbitrary angular directions. In: Proc. of AAAI 2002 Workshop on Spatial and Temporal Reasoning (2002)

    Google Scholar 

  9. Renz, J.: Maximal tractable fragments of the Region Connection Calculus: A complete analysis. In: Proc. IJCAI 1999, pp. 448–454 (1999)

    Google Scholar 

  10. Renz, J., Nebel, B.: On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus. Artificial Intelligence 108(1-2), 69–123 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  11. Renz, J., Nebel, B.: Efficient methods for qualitative spatial reasoning. JAIR 15, 289–318 (2001)

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Renz, J., Mitra, D. (2004). Qualitative Direction Calculi with Arbitrary Granularity. In: Zhang, C., W. Guesgen, H., Yeap, WK. (eds) PRICAI 2004: Trends in Artificial Intelligence. PRICAI 2004. Lecture Notes in Computer Science(), vol 3157. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28633-2_9

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-28633-2_9

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-28633-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics