Skip to main content

Combining Topological and Qualitative Size Constraints for Spatial Reasoning

  • Conference paper
  • First Online:
Principles and Practice of Constraint Programming — CP98 (CP 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1520))

Abstract

Information about the relative size of spatial regions is often easily accessible and, when combined with other types of spatial information, it can be practically very useful. In this paper we combine a simple framework for reasoning about qualitative size relations with the Region Connection Calculus RCC-8, a widely studied approach for qualitative spatial reasoning with topological relations. Reasoning about RCC-8 relations is NP-hard, but a large maximal tractable subclass of RCC-8 called H8 was identified. Interestingly, any constraint in RCC-8 - H8 can be consistently reduced to a constraint in Ĥ8, when an appropriate size constraint between the spatial regions is supplied. We propose an O(n3) time path-consistency algorithm based on a novel technique for combining RCC-8 constraints and relative size constraints, where n is the number of spatial regions. We prove its correctness and completeness for deciding consistency when the input contains topological constraints in Ĥ8. We also provide results on finding a consistent scenario in O(n3) time both for combined topological and relative size constraints, and for topological constraints alone. This is an O(n 2 ) improvement over the known methods

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. J.F. Allen. Maintaining knowledge about temporal intervals. Communication of the ACM, 26(1):832–843, 1983.

    Article  MATH  Google Scholar 

  2. T. Apostol. Mathematical Analysis. Addison Wesley, 1974.

    Google Scholar 

  3. C. Bessière. A simple way to improve path-consistency in Interval Algebra networks. In Proc. AAAI-96, pages 375–380, 1996.

    Google Scholar 

  4. R. Dechter. From local to global consistency. Artificial Intelligence, 55:87–108, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  5. A. Gerevini and J. Renz. Combining topological and qualitative size constraints for spatial reasoning. Technical report. To appear.

    Google Scholar 

  6. A. Gerevini and L. Schubert. On computing the minimal labels in time point algebra networks. Computational Intelligence, 11(3):443–448, 1995.

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  8. H. A. Kautz and P.B. Ladkin. Integrating metric and qualitative temporal reasoning. In Proc. AAAI-91, pages 241–246, 1991.

    Google Scholar 

  9. P. B. Ladkin and R. Maddux. On binary constraint networks. Technical Report KES.U.88.8, Kestrel Institute, Palo Alto, CA, 1988.

    Google Scholar 

  10. G. Ligozat. A new proof of tractability for Ord-Horn relations. In Proc. AAAI-96, pages 715–720, 1996.

    Google Scholar 

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

    Article  MATH  Google Scholar 

  12. A. K. Mackworth and E.C. Freuder. The complexity of some polynomial network consistency algorithms for constraint satisfaction problems. Artificial Intelligence, 25:65–73, 1985.

    Article  Google Scholar 

  13. D. A. Randell, Z. Cui, and A.G. Cohn. A spatial logic based on regions and connection. In Principles of Knowledge Representation and Reasoning: Proceedings of the 3rd International Conference (KR’92), pages 165–176, 1992.

    Google Scholar 

  14. J. Renz. A canonical model of the Region Connection Calculus. In Principles of Knowledge Representation and Reasoning: Proceedings of the 6th International Conference (KR’98), pages 330–341, 1998.

    Google Scholar 

  15. J. Renz and B. Nebel. On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus. In Proc. IJ-CAI’97, pages 522–527, 1997. Technical Report with full proofs available at http://www.informatik.uni-freiburg.de/~sppraum.

  16. P. van Beek. Reasoning about qualitative temporal information. Artificial Intelligence, 58(1-3):297–321, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  17. M. Vilain, H.A. 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, pages 373–381. Morgan Kaufmann, San Mateo, CA, 1990.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gerevini, A., Renz, J. (1998). Combining Topological and Qualitative Size Constraints for Spatial Reasoning. In: Maher, M., Puget, JF. (eds) Principles and Practice of Constraint Programming — CP98. CP 1998. Lecture Notes in Computer Science, vol 1520. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49481-2_17

Download citation

  • DOI: https://doi.org/10.1007/3-540-49481-2_17

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65224-3

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics