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.
@InProceedings{hella_et_al:LIPIcs.MFCS.2017.32, author = {Hella, Lauri and Kuusisto, Antti and Meier, Arne and Virtema, Jonni}, 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 = {Larsen, Kim G. and Bodlaender, Hans L. and Raskin, Jean-Francois}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.32}, URN = {urn:nbn:de:0030-drops-81007}, doi = {10.4230/LIPIcs.MFCS.2017.32}, annote = {Keywords: Inclusion Logic, Model Checking, Complexity} }
Feedback for Dagstuhl Publishing