Terminating Minimal Model Generation Procedures for Propositional Modal Logics

  • Fabio Papacchini
  • Renate A. Schmidt
Conference paper

DOI: 10.1007/978-3-319-08587-6_30

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8562)
Cite this paper as:
Papacchini F., Schmidt R.A. (2014) Terminating Minimal Model Generation Procedures for Propositional Modal Logics. In: Demri S., Kapur D., Weidenbach C. (eds) Automated Reasoning. IJCAR 2014. Lecture Notes in Computer Science, vol 8562. Springer, Cham

Abstract

Model generation and minimal model generation are useful for tasks such as model checking and for debugging of logical specifications. This paper presents terminating procedures for the generation of models minimal modulo subset-simulation for the modal logic K and all combinations of extensions with the axioms T, B, D, 4 and 5. Our procedures are minimal model sound and complete. Compared with other minimal model generation procedures, they are designed to have smaller search space and return fewer models. In order to make the models more effective for users, our minimal model criterion is aimed to be semantically meaningful, intuitive and contain a minimal amount of information. Depending on the logic, termination is ensured by a variation of equality blocking.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

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

Personalised recommendations