Details
| Originalsprache | Englisch |
|---|---|
| Seiten (von - bis) | 605-630 |
| Seitenumfang | 26 |
| Fachzeitschrift | Journal of logic and computation |
| Jahrgang | 29 |
| Ausgabenummer | 5 |
| Frühes Online-Datum | 10 Apr. 2019 |
| Publikationsstatus | Veröffentlicht - Sept. 2019 |
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 finalizing the programme that aims to completely classify the complexities of the basic reasoning problems for modal and propositional dependence, independence and inclusion logics.
ASJC Scopus Sachgebiete
- Informatik (insg.)
- Software
- Mathematik (insg.)
- Theoretische Informatik
- Geisteswissenschaftliche Fächer (insg.)
- Geisteswissenschaftliche Fächer (sonstige)
- Informatik (insg.)
- Hardware und Architektur
- Mathematik (insg.)
- Logik
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
in: Journal of logic and computation, Jahrgang 29, Nr. 5, 09.2019, S. 605-630.
Publikation: Beitrag in Fachzeitschrift › Artikel › Forschung › Peer-Review
}
TY - JOUR
T1 - Model checking and validity in propositional and modal inclusion logics
AU - Hella, Lauri
AU - Kuusisto, Antti
AU - Meier, Arne
AU - Virtema, Jonni
PY - 2019/9
Y1 - 2019/9
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 finalizing the programme that aims to completely 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 finalizing the programme that aims to completely 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
KW - team semantics
KW - validity problem
UR - http://www.scopus.com/inward/record.url?scp=85080893187&partnerID=8YFLogxK
U2 - 10.1093/logcom/exz008
DO - 10.1093/logcom/exz008
M3 - Article
AN - SCOPUS:85080893187
VL - 29
SP - 605
EP - 630
JO - Journal of logic and computation
JF - Journal of logic and computation
SN - 0955-792X
IS - 5
ER -