TY  -  
T1  - Model checking and validity in propositional and modal inclusion logics 
SN  -  /  
UR  - http://hdl.handle.net/10138/299557 
T3  - Leibniz International Proceedings in Informatics 
A1  - Hella, Lauri; Kuusisto, Antti; Meier, Arne; Virtema, J. 
A2  - Larsen, Kim G.; Bodlaender, Hans L.; Raskin, Jean-Francois 
PB  - Schloss Dagstuhl - Leibniz-Zentrum für Informatik 
Y1  - 2017 
LA  - eng 
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 finalising the programme that ultimately aims to classify the complexities of the basic reasoning problems for modal and propositional dependence, independence, and inclusion l... 
VO  -  
IS  -  
SP  -  
OP  -  
KW  - Computer circuits; Semantics, Complexity; Complexity bounds; Reasoning problems, Model checking; 111 Mathematics; 113 Computer and information sciences 
N1  -   
PP  -  
ER  -