A Proof Procedure for Hybrid Logic with Binders, Transitivity and Relation Hierarchies

  • Marta Cialdea Mayer
Conference paper

DOI: 10.1007/978-3-642-38574-2_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7898)
Cite this paper as:
Cialdea Mayer M. (2013) A Proof Procedure for Hybrid Logic with Binders, Transitivity and Relation Hierarchies. In: Bonacina M.P. (eds) Automated Deduction – CADE-24. CADE 2013. Lecture Notes in Computer Science, vol 7898. Springer, Berlin, Heidelberg

Abstract

A tableau calculus constituting a decision procedure for hybrid logic with the converse modalities, the global ones and a restricted use of the binder has been defined in a previous paper. This work shows how to extend such a calculus to multi-modal logic equipped with two features largely used in description logics, i.e. transitivity and relation inclusion assertions. An implementation of the proof procedure is also briefly presented, along with the results of some preliminary experiments.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Marta Cialdea Mayer
    • 1
  1. 1.Università di Roma TreItaly

Personalised recommendations