Journal of Automated Reasoning

, Volume 53, Issue 3, pp 305–315

Extended Decision Procedure for a Fragment of HL with Binders


DOI: 10.1007/s10817-014-9307-z

Cite this article as:
Cialdea Mayer, M. J Autom Reasoning (2014) 53: 305. doi:10.1007/s10817-014-9307-z


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.


Tableaux Modal logic Hybrid logic 

Copyright information

© Springer Science+Business Media Dordrecht 2014

Authors and Affiliations

  1. 1.Università di Roma TreRomaItaly

Personalised recommendations