Journal of Automated Reasoning

, Volume 53, Issue 3, pp 305–315 | Cite as

Extended Decision Procedure for a Fragment of HL with Binders

Article
  • 100 Downloads

Abstract

This work is a brief presentation of an extension of the proof procedure for a decidable fragment of hybrid logic presented in a previous paper. It shows how to extend such a calculus to multi-modal logic enriched with transitivity and relation inclusion assertions. A further result reported in this work is that the logic extending the considered fragment with the addition of graded modalities has an undecidable satisfiability problem, unless further syntactical restrictions are placed on their use.

Keywords

Tableaux Modal logic Hybrid logic 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bolander, T., Blackburn, P.: Terminating tableau calculi for hybrid logics extending K. Electron. Notes Theor. Comput. Sci. 231, 21–39 (2009)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Cerrito, S., Cialdea Mayer, M.: A tableaux based decision procedure for a broad class of hybrid formulae with binders. In: Automated Resoning with Analytic Tableaux and Related Methods (TABLEAUX 2011), pp. 104–118. Springer (2011)Google Scholar
  3. 3.
    Cerrito, S., Cialdea Mayer, M.: A tableau based decision procedure for a fragment of hybrid logic with binders, converse and global modalities. J. Autom. Reason. 51 (2), 197–239 (2013)CrossRefMathSciNetGoogle Scholar
  4. 4.
    Cialdea Mayer, M.: A proof procedure for hybrid logic with binders, transitivity and relation hierarchies. In: 24th Conference on Automated Deduction (CADE 2013), pp. 76–90. Springer (2013)Google Scholar
  5. 5.
    Cialdea Mayer, M.: A proof procedure for hybrid logic with binders, transitivity and relation hierarchies (extended version). Technical report, arXiv: 1312.2894 (2013)Google Scholar
  6. 6.
    Glimm, B., Horrocks, I., Sattler, U.: Conjunctive query answering for description logics with transitive roles. In: Proceedings of the 2006 International Workshop on Description Logics (DL′06), pp. 3–14 (2006)Google Scholar
  7. 7.
    Horrocks, I., Glimm, B., Sattler, U.: Hybrid logics and ontology languages. Electron. Notes Theor. Comput. Sci. 174, 3–14 (2007)CrossRefGoogle Scholar
  8. 8.
    Horrocks, I., Sattler, U.: A description logic with transitive and inverse roles and role hierarchies. J. Log. Comput. 9 (3), 385–410 (1999)CrossRefMATHMathSciNetGoogle Scholar
  9. 9.
    Horrocks, I., Sattler, U.: A tableau decision procedure for \(\mathcal {SHOIQ}\). J. Autom. Reason. 39 (3), 249–276 (2007)CrossRefMATHMathSciNetGoogle Scholar
  10. 10.
    Kaminski, M., Schneider, S., Smolka, G.: Terminating tableaux for graded hybrid logic with global modalities and role hierarchies. Log. Meth. Comput. Sci. 7 (1) (2011)Google Scholar
  11. 11.
    Kaminski, M., Smolka, G.: Terminating tableau systems for hybrid logic with difference and converse. J. Log., Lang. Inf. 18 (4), 437–464 (2009)CrossRefMATHMathSciNetGoogle Scholar
  12. 12.
    Khodadadi, M., Schmidt, R.A., Tishkovsky, D.: A refined tableau calculus with controlled blocking for the description logic \(\mathcal {SHOI}\). In: Automated Resoning with Analytic Tableaux and Related Methods (TABLEAUX 2013), pp. 188–202. Springer (2013)Google Scholar
  13. 13.
    Marx, M.: Narcissists, stepmothers and spies. In: International Workshop on Description Logics (DL 2002), vol. 53. CEUR (2002)Google Scholar
  14. 14.
    ten Cate, B., Franceschet, M.: On the complexity of hybrid logics with binders. In: Proceedings of Computer Science Logic 2005, pp. 339–354. Springer (2005)Google Scholar
  15. 15.
    Tobies, S.: The complexity of reasoning with cardinality restrictions and nominals in expressive description logics. J. Artif. Intell. Res. 12, 199–217 (2000)MATHMathSciNetGoogle Scholar
  16. 16.
    Tobies, S.: Complexity Results and Practical Algorithms for Logics in Knowledge Representation. PhD thesis, RWTH Aachen, arXiv: cs/0106031 (2001)Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2014

Authors and Affiliations

  1. 1.Università di Roma TreRomaItaly

Personalised recommendations