@INPROCEEDINGS{PapacchiniSchmidt13a,
AUTHOR = {Papacchini, F. and Schmidt, R. A.},
YEAR = {2013},
TITLE = {Computing Minimal Models Modulo Subset-Simulation for Propositional Modal Logics},
EDITOR = {Fontaine, P. and Ringeissen, C. and Schmidt, R. A.},
BOOKTITLE = {Proceedings of the 9th International Symposium on Frontiers of Combining Systems (FroCoS 2013)},
SERIES = {Lecture Notes in Artificial Intelligence},
VOLUME = {8152},
PUBLISHER = {Springer},
PAGES = {279--294},
DOI = {http://dx.doi.org/10.1007/978-3-642-40885-4_20},
URL = {\url{http://www.cs.man.ac.uk/~schmidt/publications/PapacchiniSchmidt13a.html}},
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 $\mathbf{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.
}
}