Skip to main content

Terminating Tableaux for Graded Hybrid Logic with Global Modalities and Role Hierarchies

  • Conference paper
Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2009)

Abstract

We present a terminating tableau calculus for graded hybrid logic with global modalities, reflexivity, transitivity and role hierarchies. Termination of the system is achieved through pattern-based blocking. Previous approaches to related logics all rely on chain-based blocking. Besides being conceptually simple and suitable for efficient implementation, the pattern-based approach gives us a NExpTime complexity bound for the decision procedure.

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 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. Fine, K.: In so many possible worlds. Notre Dame J. Form. Log. 13(4), 516–520 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  2. Baader, F., Calvanese, D., McGuinness, D.L., Nardi, D., Patel-Schneider, P.F. (eds.): The Description Logic Handbook: Theory, Implementation and Applications, 2nd edn. Cambridge University Press, Cambridge (2007)

    MATH  Google Scholar 

  3. Areces, C., ten Cate, B.: Hybrid logics. In: [21], pp. 821–868

    Google Scholar 

  4. Goranko, V., Passy, S.: Using the universal modality: Gains and questions. J. Log. Comput. 2(1), 5–30 (1992)

    Article  MATH  MathSciNet  Google Scholar 

  5. Horrocks, I.: Optimising Tableaux Decision Procedures for Description Logics. PhD thesis, University of Manchester (1997)

    Google Scholar 

  6. Sattler, U.: A concept language extended with different kinds of transitive roles. In: Görz, G., Hölldobler, S. (eds.) KI 1996. LNCS (LNAI), vol. 1137. Springer, Heidelberg (1996)

    Google Scholar 

  7. Baader, F., Lutz, C.: Description logic. In: [21], pp. 757–820

    Google Scholar 

  8. Horrocks, I., Sattler, U.: Ontology reasoning in the \(\mathcal{SHOQ}\)(D) description logic. In: Nebel, B. (ed.) Proc. 17th Intl. Joint Conf. on Artificial Intelligence (IJCAI 2001), pp. 199–204. Morgan Kaufmann, San Francisco (2001)

    Google Scholar 

  9. Horrocks, I., Kutz, O., Sattler, U.: The even more irresistible \(\mathcal{SROIQ}\). In: Doherty, P., Mylopoulos, J., Welty, C.A. (eds.) Proc. 10th Intl. Conf. on Principles of Knowledge Representation and Reasoning (KR 2006), pp. 57–67. AAAI Press, Menlo Park (2006)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  11. Kripke, S.A.: Semantical analysis of modal logic I: Normal modal propositional calculi. Z. Math. Logik Grundlagen Math. 9, 67–96 (1963)

    Article  MATH  MathSciNet  Google Scholar 

  12. Baader, F., Buchheit, M., Hollunder, B.: Cardinality restrictions on concepts. Artif. Intell. 88(1–2), 195–213 (1996)

    Article  MATH  Google Scholar 

  13. Motik, B., Shearer, R., Horrocks, I.: Optimized reasoning in description logics using hypertableaux. In: Pfenning, F. (ed.) CADE-21. LNCS (LNAI), vol. 4603, pp. 67–83. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  14. Kaminski, M., Smolka, G.: Terminating tableau systems for hybrid logic with difference and converse. J. Log. Lang. Inf. (to appear, 2009)

    Google Scholar 

  15. Kaminski, M., Smolka, G.: Hybrid tableaux for the difference modality. In: Areces, C., Demri, S. (eds.) Proc. 5th Workshop on Methods for Modalities (M4M5 2007). Electr. Notes Theor. Comput. Sci., vol. 231, pp. 241–257. Elsevier, Amsterdam (2009)

    Google Scholar 

  16. Götzmann, D.: Spartacus: A Tableau Prover for Hybrid Logic. M.Sc. thesis, Saarland University (2009)

    Google Scholar 

  17. Kaminski, M., Smolka, G.: Terminating tableaux for hybrid logic with the difference modality and converse. In: Armando, A., Baumgartner, P., Dowek, G. (eds.) IJCAR 2008. LNCS (LNAI), vol. 5195, pp. 210–225. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  18. Farmer, W.M.: The seven virtues of simple type theory. J. Appl. Log. 6(3), 267–286 (2008)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

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

    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

Kaminski, M., Schneider, S., Smolka, G. (2009). Terminating Tableaux for Graded Hybrid Logic with Global Modalities and Role Hierarchies. In: Giese, M., Waaler, A. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2009. Lecture Notes in Computer Science(), vol 5607. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02716-1_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02716-1_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02715-4

  • Online ISBN: 978-3-642-02716-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics