Abstrakti
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.
| Alkuperäiskieli | Englanti |
|---|---|
| Sivut | 605-630 |
| Sivumäärä | 26 |
| Julkaisu | JOURNAL OF LOGIC AND COMPUTATION |
| Vuosikerta | 29 |
| Numero | 5 |
| DOI - pysyväislinkit | |
| Tila | Julkaistu - 2019 |
| OKM-julkaisutyyppi | A1 Alkuperäisartikkeli tieteellisessä aikakauslehdessä |
Tutkimusalat
- Inclusion logic
- complexity
- model checking
- team semantics
- validity problem
Julkaisufoorumi-taso
- Jufo-taso 2