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.
The first author is supported by an EPSRC EU Doctoral Training Award.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baader, F.: Least common subsumers and most specific concepts in a description logic with existential restrictions and terminological cycles. In: IJCAI 2003, pp. 319–324. Morgan Kaufmann (2003)
Baumgartner, P., Fürbach, U., Niemelä, I.: Hyper tableaux. In: Orłowska, E., Alferes, J.J., Moniz Pereira, L. (eds.) JELIA 1996. LNCS, vol. 1126, pp. 1–17. Springer, Heidelberg (1996)
Bry, F., Torge, S.: A deduction method complete for refutation and finite satisfiability. In: Dix, J., Fariñas del Cerro, L., Furbach, U. (eds.) JELIA 1998. LNCS (LNAI), vol. 1489, pp. 122–138. Springer, Heidelberg (1998)
Bry, F., Yahya, A.: Positive unit hyperresolution tableaux and their application to minimal model generation. J. Automated Reasoning 25(1), 35–82 (2000)
Clarke, E.M., Schlingloff, B.: Model checking. In: Handbook of Automated Reasoning, pp. 1635–1790. Elsevier (2001)
Divroodi, A.R., Nguyen, L.A.: On bisimulations for description logics. CoRR abs/1104.1964 (2011)
Gentilini, R., Piazza, C., Policriti, A.: From bisimulation to simulation - coarsest partition problems. J. Automated Reasoning 31, 73–103 (2002)
Henzinger, M.R., Henzinger, T.A., Kopke, P.W.: Computing simulations on finite and infinite graphs. In: Proc. FCS-36, pp. 453–462. IEEE Computer Society (1995)
Hintikka, J.: Model minimization - an alternative to circumscription. J. Automated Reasoning 4(1), 1–13 (1988)
Lorenz, S.: A tableaux prover for domain minimization. J. Automated Reasoning 13(3), 375–390 (1994)
Lutz, C., Wolter, F.: Deciding inseparability and conservative extensions in the description logic \(\mathcal{EL}\). J. Symbolic Computation 45(2), 194–228 (2010)
Niemelä, I.: Implementing circumscription using a tableau method. In: Proc. ECAI 1996, pp. 80–84. Wiley (1996)
Papacchini, F., Schmidt, R.A.: A tableau calculus for minimal modal model generation. ENTCS 278(3), 159–172 (2011)
Reiter, R.: A theory of diagnosis from first principles. Artificial Intelligence 32(1), 57–95 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/978-3-642-40885-4_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-40885-4_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40884-7
Online ISBN: 978-3-642-40885-4
eBook Packages: Computer ScienceComputer Science (R0)