Computing minimal models modulo subset-simulation for modal logics

Fabio Papacchini; Renate A. Schmidt

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

Computing minimal models modulo subset-simulation for modal logics

Research output: Chapter in Book/Conference proceeding › Conference contribution › peer-review

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. © 2013 Springer-Verlag.

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)\|Lect. Notes Comput. Sci.
Publisher	Springer Nature
Pages	279-294
Number of pages	15
Volume	8152
ISBN (Print)	9783642408847
DOIs	https://doi.org/10.1007/978-3-642-40885-4_20
Publication status	Published - 2013
Event	9th International Symposium on Frontiers of Combining Systems, FroCoS 2013 - Nancy Duration: 1 Jul 2013 → … http://www.cs.man.ac.uk/ schmidt/publications/KoopmannSchmidt13a.html

Publication series

Name	Lecture Notes in Artificial Intelligence

Conference

Conference	9th International Symposium on Frontiers of Combining Systems, FroCoS 2013
City	Nancy
Period	1/07/13 → …
Internet address	http://www.cs.man.ac.uk/ schmidt/publications/KoopmannSchmidt13a.html

Access to Document

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

Cite this

Papacchini, F., & Schmidt, R. A. (2013). Computing minimal models modulo subset-simulation for modal logics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci. (Vol. 8152, pp. 279-294). (Lecture Notes in Artificial Intelligence). Springer Nature. https://doi.org/10.1007/978-3-642-40885-4_20

@inproceedings{71baabd3aaf543068e2379d14b17ef28,

title = "Computing minimal models modulo subset-simulation for modal logics",

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. {\textcopyright} 2013 Springer-Verlag.",

author = "Fabio Papacchini and Schmidt, {Renate A.}",

year = "2013",

doi = "10.1007/978-3-642-40885-4_20",

language = "English",

isbn = "9783642408847",

volume = "8152",

series = "Lecture Notes in Artificial Intelligence",

publisher = "Springer Nature",

pages = "279--294",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.",

address = "United States",

note = "9th International Symposium on Frontiers of Combining Systems, FroCoS 2013 ; Conference date: 01-07-2013",

url = "http://www.cs.man.ac.uk/ schmidt/publications/KoopmannSchmidt13a.html",

}

Papacchini, F & Schmidt, RA 2013, Computing minimal models modulo subset-simulation for modal logics. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.. vol. 8152, Lecture Notes in Artificial Intelligence, Springer Nature, pp. 279-294, 9th International Symposium on Frontiers of Combining Systems, FroCoS 2013, Nancy, 1/07/13. https://doi.org/10.1007/978-3-642-40885-4_20

Computing minimal models modulo subset-simulation for modal logics. / Papacchini, Fabio; Schmidt, Renate A.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.. Vol. 8152 Springer Nature, 2013. p. 279-294 (Lecture Notes in Artificial Intelligence).

Research output: Chapter in Book/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Computing minimal models modulo subset-simulation for modal logics

AU - Papacchini, Fabio

AU - Schmidt, Renate A.

PY - 2013

Y1 - 2013

N2 - 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. © 2013 Springer-Verlag.

AB - 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. © 2013 Springer-Verlag.

U2 - 10.1007/978-3-642-40885-4_20

DO - 10.1007/978-3-642-40885-4_20

M3 - Conference contribution

SN - 9783642408847

VL - 8152

T3 - Lecture Notes in Artificial Intelligence

SP - 279

EP - 294

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.

PB - Springer Nature

T2 - 9th International Symposium on Frontiers of Combining Systems, FroCoS 2013

Y2 - 1 July 2013

ER -

Papacchini F, Schmidt RA. Computing minimal models modulo subset-simulation for modal logics. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|Lect. Notes Comput. Sci.. Vol. 8152. Springer Nature. 2013. p. 279-294. (Lecture Notes in Artificial Intelligence). doi: 10.1007/978-3-642-40885-4_20

Computing minimal models modulo subset-simulation for modal logics

Abstract

Publication series

Conference

Access to Document

Fingerprint

Cite this