Skip to main content
SpringerLink
Log in
Book cover

International Conference on Logic for Programming Artificial Intelligence and Reasoning

LPAR 2008: Logic for Programming, Artificial Intelligence, and Reasoning pp 574–589Cite as

On the Computational Complexity of Spatial Logics with Connectedness Constraints

  • Conference paper

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

Abstract

We investigate the computational complexity of spatial logics extended with the means to represent topological connectedness and restrict the number of connected components. In particular, we show that the connectedness constraints can increase complexity from NP to PSpace, ExpTime and, if component counting is allowed, to NExpTime.

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

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. Borgo, S., Guarino, N., Masolo, C.: A pointless theory of space based on strong connection and congruence. In: Aiello, L., Doyle, J., Shapiro, S. (eds.) KR, pp. 220–229. Morgan Kaufmann, San Francisco (1996)

    Google Scholar 

  2. Bourbaki, N.: General Topology, Part 1. Addison-Wesley, Hermann (1966)

    MATH  Google Scholar 

  3. Cantone, D., Cutello, V.: Decision algorithms for elementary topology I. Topological syllogistics with set and map constructs, connectedness and cardinailty composition. Comm. on Pure and Appl. Mathematics XLVII, 1197–1217 (1994)

    Article  MATH  Google Scholar 

  4. Cohn, A., Renz, J.: Qualitative spatial representation and reasoning. In: van Hermelen, F., Lifschitz, V., Porter, B. (eds.) Handbook of Knowledge Representation, pp. 551–596. Elsevier, Amsterdam (2008)

    Chapter  Google Scholar 

  5. Davis, E.: The expressivity of quantifying over regions. Journal of Logic and Computation 16, 891–916 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  6. Dimov, G., Vakarelov, D.: Contact algebras and region-based theory of space: A proximity approach, I. Fundamenta Informaticae 74, 209–249 (2006)

    MathSciNet  MATH  Google Scholar 

  7. Dornheim, C.: Undecidability of plane polygonal mereotopology. In: Cohn, A., Schubert, L., Shapiro, S. (eds.) KR, pp. 342–353. Morgan Kaufmann, San Francisco (1998)

    Google Scholar 

  8. Egenhofer, M., Franzosa, R.: Point-set topological spatial relations. International Journal of Geographical Information Systems 5, 161–174 (1991)

    Article  Google Scholar 

  9. De Giacomo, G.: Decidability of Class-Based Knowledge Representation Formalisms. PhD thesis, Università degli Studi di Roma ‘La Sapienza’ (1995)

    Google Scholar 

  10. Grzegorczyk, A.: Undecidability of some topological theories. Fundamenta Mathematicae 38, 137–152 (1951)

    MathSciNet  Google Scholar 

  11. Kratochvíl, J., Matoušek, J.: String graphs requiring exponential representations. J. of Combinatorial Theory, Series B 53, 1–4 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  12. Lutz, C., Wolter, F.: Modal logics of topological relations. Logical Methods in Computer Science, 2 (2006)

    Google Scholar 

  13. McKinsey, J.C.C., Tarski, A.: The algebra of topology. Annals of Mathematics 45, 141–191 (1944)

    Article  MathSciNet  MATH  Google Scholar 

  14. Newman, M.: Elements of the Topology of Plane Sets of Points. Cambridge (1964)

    Google Scholar 

  15. Pratt-Hartmann, I.: A topological constraint language with component counting. Journal of Applied Non-Classical Logics 12, 441–467 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  16. Randell, D., Cui, Z., Cohn, A.: A spatial logic based on regions and connection. In: Nebel, B., Rich, C., Swartout, W. (eds.) Proceedings of KR, pp. 165–176. Morgan Kaufmann, San Francisco (1992)

    Google Scholar 

  17. Renz, J.: A canonical model of the region connection calculus. In: Cohn, A., Schubert, L., Shapiro, S. (eds.) KR, pp. 330–341. Morgan Kaufmann, San Francisco (1998)

    Google Scholar 

  18. Renz, J., Nebel, B.: Qualitative spatial reasoning using constraint calculi. In: Aiello, M., Pratt-Hartmann, I., van Benthem, J. (eds.) Handbook of Spatial Logics, pp. 161–216. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  19. Reynolds, M.: The complexity of the temporal logic over the reals (Manuscript, 2008), http://www.csse.uwa.edu.au/~mark/research/Online/CORT.htm

  20. Schaefer, M., Sedgwick, E., Štefankovič, D.: Recognizing string graphs in NP. Journal of Computer and System Sciences 67, 365–380 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  21. Shehtman, V.: Everywhere and Here. Journal of Applied Non-Classical Logics 9, 369–380 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  22. Whitehead, A.N.: Process and Reality. MacMillan Company, New York (1929)

    MATH  Google Scholar 

  23. Wolter, F., Zakharyaschev, M.: Spatial reasoning in RCC-8 with Boolean region terms. In: Horn, W. (ed.) Proceedings of ECAI, pp. 244–248. IOS Press, Amsterdam (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Birkbeck College London, UK

    Roman Kontchakov & Michael Zakharyaschev

  2. Department of Computer Science, Manchester University, UK

    Ian Pratt-Hartmann

  3. Department of Computer Science, University of Liverpool, UK

    Frank Wolter

Authors
  1. Roman Kontchakov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ian Pratt-Hartmann
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Frank Wolter
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Michael Zakharyaschev
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Carnegie Mellon University, Doha, Qatar

    Iliano Cervesato

  2. Technische Universität Darmstadt, Germany

    Helmut Veith

  3. University of Manchester, UK

    Andrei Voronkov

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kontchakov, R., Pratt-Hartmann, I., Wolter, F., Zakharyaschev, M. (2008). On the Computational Complexity of Spatial Logics with Connectedness Constraints. In: Cervesato, I., Veith, H., Voronkov, A. (eds) Logic for Programming, Artificial Intelligence, and Reasoning. LPAR 2008. Lecture Notes in Computer Science(), vol 5330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-89439-1_40

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-89439-1_40

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-89438-4

  • Online ISBN: 978-3-540-89439-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation