Model checking and validity in propositional and modal inclusion logics

Lauri Hella, Antti Kuusisto, Arne Meier, Jonni Virtema

Research output: Contribution to journalArticleScientificpeer-review

7 Citations (Scopus)

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 languageEnglish
Pages (from-to)605-630
Number of pages26
JournalJOURNAL OF LOGIC AND COMPUTATION
Volume29
Issue number5
DOIs
Publication statusPublished - 2019
Publication typeA1 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