Details
| Original language | English |
|---|---|
| Title of host publication | 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017 |
| Editors | Kim G. Larsen, Jean-Francois Raskin, Hans L. Bodlaender |
| Publisher | Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing |
| ISBN (electronic) | 9783959770460 |
| Publication status | Published - 1 Dec 2017 |
| Event | 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017 - Aalborg, Denmark Duration: 21 Aug 2017 → 25 Aug 2017 |
Publication series
| Name | Leibniz International Proceedings in Informatics, LIPIcs |
|---|---|
| Volume | 83 |
| ISSN (Print) | 1868-8969 |
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.
Keywords
- Complexity, Inclusion Logic, Model Checking
ASJC Scopus subject areas
- Computer Science(all)
- Software
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017. ed. / Kim G. Larsen; Jean-Francois Raskin; Hans L. Bodlaender. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2017. (Leibniz International Proceedings in Informatics, LIPIcs; Vol. 83).
Research output: Chapter in book/report/conference proceeding › Conference contribution › Research › peer review
}
TY - GEN
T1 - Model checking and validity in propositional and modal inclusion logics
AU - Hella, Lauri
AU - Kuusisto, Antti
AU - Meier, Arne
AU - Virtema, Jonni
N1 - Funding information: ? The second and the last author acknowledges support from Jenny and Antti Wihuri Foundation. The last author is also supported by the grant 292767 of the Academy of Finland. The third author is supported by the DFG grant ME 4279/1-1. We thank the anonymous referees for their comments.
PY - 2017/12/1
Y1 - 2017/12/1
N2 - 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.
AB - 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.
KW - Complexity
KW - Inclusion Logic
KW - Model Checking
UR - http://www.scopus.com/inward/record.url?scp=85038440300&partnerID=8YFLogxK
U2 - 10.4230/LIPIcs.MFCS.2017.32
DO - 10.4230/LIPIcs.MFCS.2017.32
M3 - Conference contribution
AN - SCOPUS:85038440300
T3 - Leibniz International Proceedings in Informatics, LIPIcs
BT - 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017
A2 - Larsen, Kim G.
A2 - Raskin, Jean-Francois
A2 - Bodlaender, Hans L.
PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
T2 - 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017
Y2 - 21 August 2017 through 25 August 2017
ER -