| dc.contributor.author |
Hella, Lauri |
|
| dc.contributor.author |
Kuusisto, Antti |
|
| dc.contributor.author |
Meier, Arne |
|
| dc.contributor.author |
Virtema, J. |
|
| dc.contributor.editor |
Larsen, Kim G. |
|
| dc.contributor.editor |
Bodlaender, Hans L. |
|
| dc.contributor.editor |
Raskin, Jean-Francois |
|
| dc.date.accessioned |
2019-02-27T10:31:01Z |
|
| dc.date.available |
2019-02-27T10:31:01Z |
|
| dc.date.issued |
2017 |
|
| dc.identifier.citation |
Hella , L , Kuusisto , A , Meier , A & Virtema , J 2017 , Model checking and validity in propositional and modal inclusion logics . in K G Larsen , H L Bodlaender & J-F Raskin (eds) , 42nd International Symposium on Mathematical Foundations of Computer Science . , 32 , Leibniz International Proceedings in Informatics , vol. 83 , Schloss Dagstuhl - Leibniz-Zentrum für Informatik , Wadern , International Symposium on Mathematical Foundations of Computer Science , Aalborg , Denmark , 21/08/2017 . https://doi.org/10.4230/LIPIcs.MFCS.2017.32 |
|
| dc.identifier.citation |
conference |
|
| dc.identifier.other |
PURE: 122730869 |
|
| dc.identifier.other |
PURE UUID: 6e3c8ee1-c619-40d7-a68b-326244ab6659 |
|
| dc.identifier.other |
Bibtex: urn:9890bcc3f1b90ccce0703df978373dd7 |
|
| dc.identifier.other |
Scopus: 85038440300 |
|
| dc.identifier.uri |
http://hdl.handle.net/10138/299557 |
|
| 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. |
en |
| dc.format.extent |
14 |
|
| dc.language.iso |
eng |
|
| dc.publisher |
Schloss Dagstuhl - Leibniz-Zentrum für Informatik |
|
| dc.relation.ispartof |
42nd International Symposium on Mathematical Foundations of Computer Science |
|
| dc.relation.ispartofseries |
Leibniz International Proceedings in Informatics |
|
| dc.relation.isversionof |
978-3-95977-046-0 |
|
| dc.rights |
cc_by |
|
| dc.rights.uri |
info:eu-repo/semantics/openAccess |
|
| dc.subject |
Computer circuits |
|
| dc.subject |
Semantics, Complexity |
|
| dc.subject |
Complexity bounds |
|
| dc.subject |
Reasoning problems, Model checking |
|
| dc.subject |
111 Mathematics |
|
| dc.subject |
113 Computer and information sciences |
|
| dc.title |
Model checking and validity in propositional and modal inclusion logics |
en |
| dc.type |
Conference contribution |
|
| dc.contributor.organization |
Department of Mathematics and Statistics |
|
| dc.description.reviewstatus |
Peer reviewed |
|
| dc.relation.doi |
https://doi.org/10.4230/LIPIcs.MFCS.2017.32 |
|
| dc.relation.issn |
1868-8969 |
|
| dc.rights.accesslevel |
openAccess |
|
| dc.type.version |
publishedVersion |
|
