2026-08-10T10:24:28Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:8100 2024-03-06T10:40:53Z ddc:004 open_access

Model Checking and Validity in Propositional and Modal Inclusion Logics Hella, Lauri Kuusisto, Antti Meier, Arne Virtema, Jonni Inclusion Logic Model Checking Complexity 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Lauri Hella and Antti Kuusisto and Arne Meier and Jonni Virtema 2017 Is Part Of LIPIcs, Volume 83, 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.MFCS.2017.32 urn:nbn:de:0030-drops-81007 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2017.32 eng https://creativecommons.org/licenses/by/3.0/legalcode