Model checking and validity in propositional and modal inclusion logics

Zur Kurzanzeige

dc.identifier.uri http://dx.doi.org/10.15488/3364
dc.identifier.uri http://www.repo.uni-hannover.de/handle/123456789/3394
dc.contributor.author Hella, Lauri
dc.contributor.author Kuusisto, Antti
dc.contributor.author Meier, Arne
dc.contributor.author Virtema, Jonni
dc.date.accessioned 2018-05-23T07:46:37Z
dc.date.available 2018-05-23T07:46:37Z
dc.date.issued 2017
dc.identifier.citation Hella, L.; Kuusisto, A.; Meier, A.; Virtema, J.: Model checking and validity in propositional and modal inclusion logics. In: Leibniz International Proceedings in Informatics, LIPIcs 83 (2017), 32. DOI: https://doi.org/10.4230/LIPIcs.MFCS.2017.32
dc.description.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. eng
dc.language.iso eng
dc.publisher Wadern : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH
dc.relation.ispartofseries Leibniz International Proceedings in Informatics, LIPIcs 83 (2017)
dc.rights CC BY 4.0 Unported
dc.rights.uri https://creativecommons.org/licenses/by/4.0/
dc.subject Complexity eng
dc.subject Inclusion Logic eng
dc.subject Model Checking eng
dc.subject Computer circuits eng
dc.subject Semantics eng
dc.subject Complexity eng
dc.subject Complexity bounds eng
dc.subject Reasoning problems eng
dc.subject Model checking eng
dc.subject.classification Konferenzschrift ger
dc.subject.ddc 004 | Informatik ger
dc.title Model checking and validity in propositional and modal inclusion logics
dc.type Article
dc.type Text
dc.relation.issn 1868-8969
dc.relation.doi https://doi.org/10.4230/LIPIcs.MFCS.2017.32
dc.bibliographicCitation.issue 32
dc.bibliographicCitation.volume 83
dc.description.version publishedVersion
tib.accessRights frei zug�nglich


Die Publikation erscheint in Sammlung(en):

Zur Kurzanzeige

 

Suche im Repositorium


Durchblättern

Mein Nutzer/innenkonto

Nutzungsstatistiken