Skip to main content

A Decidable Spatial Logic with Cone-Shaped Cardinal Directions

  • Conference paper
Computer Science Logic (CSL 2009)

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

Included in the following conference series:

Abstract

We introduce a spatial modal logic based on cone-shaped cardinal directions over the rational plane and we prove that, unlike projection-based ones, such as, for instance, Compass Logic, its satisfiability problem is decidable (PSPACE-complete). We also show that it is expressive enough to subsume meaningful interval temporal logics, thus generalizing previous results in the literature, e.g., its decidability implies that of the subinterval/superinterval temporal logic interpreted over the rational line.

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Aiello, M., Pratt-Hartmann, I., van Benthem, J.: Handbook of Spatial Logics. Springer, Heidelberg (2007)

    Book  MATH  Google Scholar 

  2. Allen, J.F.: Maintaining knowledge about temporal intervals. Communications of the Association for Computing Machinery 26(11), 832–843 (1983)

    Article  MATH  Google Scholar 

  3. Bresolin, D., Goranko, V., Montanari, A., Sala, P.: Tableau-based decision procedures for the logics of subinterval structures over dense orderings. Journal of Logic and Computation (2008), doi:10.1093/logcom/exn063

    Google Scholar 

  4. Frank, A.U.: Qualitative spatial reasoning about distances and directions in geographic space. Journal of Visual Languages and Computing 3, 343–371 (1992)

    Article  Google Scholar 

  5. Gabbay, D.M., Kurucz, A., Wolter, F., Zakharyaschev, M.: Many-Dimensional Modal Logics: theory and applications. Studies in Logic and the Foundations of Mathematics, vol. 148. Elsevier Science Publishers, Amsterdam (2003)

    MATH  Google Scholar 

  6. Lodaya, K.: Sharpening the undecidability of interval temporal logic. In: He, J., Sato, M. (eds.) ASIAN 2000. LNCS, vol. 1961, pp. 290–298. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  7. Marx, M., Reynolds, M.: Undecidability of compass logic. Journal of Logic and Computation 9(6), 897–914 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  8. Meier, A., Mundhenk, M., Thomas, M., Vollmer, H.: The complexity of satisfiability for fragments of CTL and CTL*. Electronic Notes in Theoretical Computer Science 223, 201–213 (2008)

    Article  MATH  Google Scholar 

  9. Morales, A., Navarrete, I., Sciavicco, G.: A new modal logic for reasoning about space: spatial propositional neighborhood logic. Annals of Mathematics and Artificial Intelligence 51(1), 1–25 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  10. Safra, S.: On the complexity of ω-automata. In: Proceedings of the 29th Annual Symposium on Foundations of Computer Science, pp. 319–327. IEEE Computer Society Press, Los Alamitos (1988)

    Google Scholar 

  11. Shapirovsky, I., Shehtman, V.B.: Chronological future modality in Minkowski spacetime. In: Proceedings of the 4th Conference on Advances in Modal Logic, pp. 437–460. King’s College Publications (2003)

    Google Scholar 

  12. Stock, O.: Spatial and Temporal Reasoning. Kluwer Academic Publishers, Dordrecht (1997)

    Book  Google Scholar 

  13. Venema, Y.: Expressiveness and completeness of an interval tense logic. Notre Dame Journal of Formal Logic 31(4), 529–547 (1990)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Montanari, A., Puppis, G., Sala, P. (2009). A Decidable Spatial Logic with Cone-Shaped Cardinal Directions. In: Grädel, E., Kahle, R. (eds) Computer Science Logic. CSL 2009. Lecture Notes in Computer Science, vol 5771. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04027-6_29

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04027-6_29

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04026-9

  • Online ISBN: 978-3-642-04027-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics