Skip to main content
SpringerLink
Log in

Terminating Tableaux for Hybrid Logic with the Difference Modality and Converse

  • Conference paper
Automated Reasoning (IJCAR 2008)

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

Included in the following conference series:

Abstract

We present the first terminating tableau calculus for basic hybrid logic with the difference modality and converse modalities. The language under consideration is basic multi-modal logic extended with nominals, the satisfaction operator, converse, global and difference modalities. All of the constructs are handled natively.

To obtain termination, we extend chain-based blocking for logics with converse by a complete treatment of difference.

Completeness of our calculus is shown via a model existence theorem that refines previous constructions by distinguishing between modal and equational state equivalence.

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

Access this chapter

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Balbiani, P., Demri, S.: Prefixed tableaux systems for modal logics with enriched languages. In: Ralescu, A.L., Shanahan, J.G. (eds.) Proc. 15th Intl. Joint Conf. on Artificial Intelligence (IJCAI 1997), pp. 190–195. Morgan Kaufmann, San Francisco (1997)

    Google Scholar 

  2. Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press, Cambridge (2001)

    MATH  Google Scholar 

  3. Gargov, G., Goranko, V.: Modal logic with names. Journal of Philosophical Logic 22, 607–636 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  4. Areces, C., ten Cate, B.: Hybrid logics. In: [33]

    Google Scholar 

  5. Goranko, V.: Modal definability in enriched languages. Notre Dame Journal of Formal Logic 31(1), 81–105 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  6. de Rijke, M.: The modal logic of inequality. J. Symb. Log. 57(2), 566–584 (1992)

    Article  MATH  Google Scholar 

  7. Venema, Y.: Derivation rules as anti-axioms in modal logic. J. Symb. Log. 58(3), 1003–1034 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  8. Areces, C., Blackburn, P., Marx, M.: The computational complexity of hybrid temporal logics. L. J. of the IGPL 8(5), 653–679 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  9. Fitting, M.: Modal proof theory. In: [33]

    Google Scholar 

  10. Kaminski, M., Smolka, G.: Hybrid tableaux for the difference modality. In: 5th Workshop on Methods for Modalities (M4M-5) (2007)

    Google Scholar 

  11. Hughes, G.E., Cresswell, M.J.: An Introduction to Modal Logic. Methuen (1968)

    Google Scholar 

  12. Halpern, J.Y., Moses, Y.: A guide to completeness and complexity for modal logics of knowledge and belief. Artif. Intell. 54, 319–379 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  13. Horrocks, I., Hustadt, U., Sattler, U., Schmidt, R.: Computational modal logic. In: [33]

    Google Scholar 

  14. Bolander, T., Blackburn, P.: Termination for hybrid tableaus. J. Log. Comput. 17(3), 517–554 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  15. Horrocks, I., Sattler, U.: A description logic with transitive and inverse roles and role hierarchies. J. Log. Comput. 9(3), 385–410 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  16. Horrocks, I., Sattler, U., Tobies, S.: Practical reasoning for very expressive description logics. L. J. of the IGPL 8(3), 239–263 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  17. Horrocks, I., Sattler, U.: A tableau decision procedure for \(\mathcal{SHOIQ}\). J. Autom. Reasoning 39(3), 249–276 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  18. Hollunder, B., Baader, F.: Qualifying number restrictions in concept languages. In: Allen, J., Fikes, R., Sandewall, E. (eds.) Proc. 2nd Intl. Conf. on Principles of Knowledge Representation and Reasoning (KR 1991), pp. 335–346. Morgan Kaufmann, San Francisco (1991)

    Google Scholar 

  19. Calvanese, D., De Giacomo, G., Rosati, R.: A note on encoding inverse roles and functional restrictions in \(\mathcal{ALC}\) knowledge bases. In: Franconi, E., De Giacomo, G., MacGregor, R.M., Nutt, W., Welty, C.A. (eds.) Proc. 1998 Intl. Workshop on Description Logics (DL 1998). CEUR Workshop Proceedings, vol. 11, pp. 69–71 (1998)

    Google Scholar 

  20. Grädel, E.: On the restraining power of guards. J. Symb. Log. 64(4), 1719–1742 (1999)

    Article  MATH  Google Scholar 

  21. Ganzinger, H., de Nivelle, H.: A superposition decision procedure for the guarded fragment with equality. In: Proc. 14th Annual IEEE Symposium on Logic in Computer Science (LICS 1999), pp. 295–304. IEEE Computer Society Press, Los Alamitos (1999)

    Google Scholar 

  22. Gallin, D.: Intensional and Higher-Order Modal Logic. With Applications to Montague Semantics. Mathematics Studies, vol. 19. North-Holland, Amsterdam (1975)

    Book  MATH  Google Scholar 

  23. Gamut, L.T.F.: Logic, Language and Meaning. In: Intensional Logic and Logical Grammar, vol. 2. The University of Chicago Press (1991)

    Google Scholar 

  24. Carpenter, B.: Type-Logical Semantics. Language, Speech, and Communication. The MIT Press, Cambridge (1997)

    Google Scholar 

  25. Hardt, M., Smolka, G.: Higher-order syntax and saturation algorithms for hybrid logic. Electr. Notes Theor. Comput. Sci. 174(6), 15–27 (2007)

    Article  Google Scholar 

  26. Benzmüller, C.E., Paulson, L.C.: Exploring properties of normal multimodal logics in simple type theory with LEO-II. In: Benzmüller, C.E., Brown, C.E., Siekmann, J., Statman, R. (eds.) Festschrift in Honor of Peter B. Andrews on His 70th Birthday. Studies in Logic and the Foundations of Mathematics. IFCoLog (to appear)

    Google Scholar 

  27. Kaminski, M., Smolka, G.: A straightforward saturation-based decision procedure for hybrid logic. In: Intl. Workshop on Hybrid Logic 2007 (HyLo 2007) (2007)

    Google Scholar 

  28. Bolander, T., Braüner, T.: Tableau-based decision procedures for hybrid logic. J. Log. Comput. 16(6), 737–763 (2006)

    Article  MATH  Google Scholar 

  29. Massacci, F.: Strongly analytic tableaux for normal modal logics. In: Bundy, A. (ed.) CADE 1994. LNCS(LNAI), vol. 814, pp. 723–737. Springer, Heidelberg (1994)

    Google Scholar 

  30. Donini, F.M., Massacci, F.: Exptime tableaux for \(\mathcal{ALC}\). Artif. Intell. 124(1), 87–138 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  31. Goré, R., Nguyen, L.A.: EXPTIME tableaux with global caching for description logics with transitive roles, inverse roles and role hierarchies. In: Olivetti, N. (ed.) TABLEAUX 2007. LNCS (LNAI), vol. 4548, pp. 133–148. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  32. Spaan, E.: Complexity of Modal Logics. PhD thesis, ILLC, University of Amsterdam (1993)

    Google Scholar 

  33. Blackburn, P., van Benthem, J., Wolter, F. (eds.): Handbook of Modal Logic. Studies in Logic and Practical Reasoning, vol. 3. Elsevier, Amsterdam (2006)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Programming Systems Lab, Saarland University, Campus E1 3, 66123, Saarbrücken, Germany

    Mark Kaminski & Gert Smolka

Authors
  1. Mark Kaminski
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gert Smolka
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Alessandro Armando Peter Baumgartner Gilles Dowek

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kaminski, M., Smolka, G. (2008). Terminating Tableaux for Hybrid Logic with the Difference Modality and Converse. In: Armando, A., Baumgartner, P., Dowek, G. (eds) Automated Reasoning. IJCAR 2008. Lecture Notes in Computer Science(), vol 5195. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71070-7_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71070-7_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71069-1

  • Online ISBN: 978-3-540-71070-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation