Computing Minimal Models Modulo Subset-Simulation for Modal Logics

  • Fabio Papacchini
  • Renate A. Schmidt
Conference paper

DOI: 10.1007/978-3-642-40885-4_20

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8152)
Cite this paper as:
Papacchini F., Schmidt R.A. (2013) Computing Minimal Models Modulo Subset-Simulation for Modal Logics. In: Fontaine P., Ringeissen C., Schmidt R.A. (eds) Frontiers of Combining Systems. FroCoS 2013. Lecture Notes in Computer Science, vol 8152. Springer, Berlin, Heidelberg

Abstract

In this paper we propose a novel minimality criterion for models of modal logics based on a variation of the notion of simulation, called subset-simulation. We present a minimal model sound and complete tableau calculus for the generation of this new kind of minimal models for the multi-modal logic K(m), and we discuss extensions to cover more expressive logics. The generation of minimal models is performed incrementally by using a minimality test to close branches representing non-minimal models, or to update the set of minimal models. Subset-simulation minimal models have the advantage that they are semantically more natural than models obtained by using syntactic minimality criteria.

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

  • Fabio Papacchini
    • 1
  • Renate A. Schmidt
    • 1
  1. 1.The University of ManchesterUK

Personalised recommendations