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.
| Original language | English |
|---|---|
| Pages (from-to) | 605-630 |
| Number of pages | 26 |
| Journal | Journal of Logic and Computation |
| Volume | 29 |
| Issue number | 5 |
| DOIs | |
| Publication status | Published - 2019 |
| Publication type | A1 Journal article-refereed |
Keywords
- Inclusion logic
- complexity
- model checking
- team semantics
- validity problem
Publication forum classification
- Publication forum level 2
Fingerprint
Dive into the research topics of 'Model checking and validity in propositional and modal inclusion logics'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver