Browsing by Subject "Complexity bounds"

Sort by: Order: Results:

Now showing items 1-1 of 1
  • Hella, Lauri; Kuusisto, Antti; Meier, Arne; Virtema, J. (Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2017)
    Leibniz International Proceedings in Informatics
    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.