Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2017.32
URN: urn:nbn:de:0030-drops-81007
URL: https://drops.dagstuhl.de/opus/volltexte/2017/8100/
Hella, Lauri ; Kuusisto, Antti ; Meier, Arne ; Virtema, Jonni
Model Checking and Validity in Propositional and Modal Inclusion Logics
| pdf-format: |
|
Abstract
Propositional and modal inclusion logic are formalisms that belong to the family of logics based on team semantics. This article investigates the model checking and validity problems of these logics. We identify complexity bounds for both problems, covering both lax and strict team semantics. By doing so, we come close to finalising the programme that ultimately aims to classify the complexities of the basic reasoning problems for modal and propositional dependence, independence, and inclusion logics.
BibTeX - Entry
@InProceedings{hella_et_al:LIPIcs:2017:8100,
author = {Lauri Hella and Antti Kuusisto and Arne Meier and Jonni Virtema},
title = {{Model Checking and Validity in Propositional and Modal Inclusion Logics}},
booktitle = {42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017)},
pages = {32:1--32:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-046-0},
ISSN = {1868-8969},
year = {2017},
volume = {83},
editor = {Kim G. Larsen and Hans L. Bodlaender and Jean-Francois Raskin},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/8100},
URN = {urn:nbn:de:0030-drops-81007},
doi = {10.4230/LIPIcs.MFCS.2017.32},
annote = {Keywords: Inclusion Logic, Model Checking, Complexity}
}
| Keywords: | Inclusion Logic, Model Checking, Complexity | |
| Seminar: | 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017) | |
| Issue date: | 2017 | |
| Date of publication: | 01.12.2017 |
