Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/28311| Title: | Model checking and validity in propositional and modal inclusion logics | Authors: | Hella, Lauri Kuusisto, Antti Meier, Arne VIRTEMA, Jonni |
Issue Date: | 2019 | Publisher: | OXFORD UNIV PRESS | Source: | JOURNAL OF LOGIC AND COMPUTATION, 29(5), p. 605-630 | 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. | Keywords: | Inclusion logic;model checking;validity problem;complexity;team semantics | Document URI: | http://hdl.handle.net/1942/28311 | ISSN: | 0955-792X | e-ISSN: | 1465-363X | DOI: | 10.1093/logcom/exz008 | ISI #: | WOS:000493111600003 | Category: | A1 | Type: | Journal Contribution | Validations: | ecoom 2020 |
| Appears in Collections: | Research publications |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| oup-accepted-manuscript-2019.pdf | Peer-reviewed author version | 514.64 kB | Adobe PDF | View/Open |
| oup-accepted-manuscript-2019.pdf Restricted Access | Published version | 511.85 kB | Adobe PDF | View/Open Request a copy |
SCOPUSTM
Citations
1
checked on Sep 2, 2020
WEB OF SCIENCETM
Citations
4
checked on Apr 30, 2024
Page view(s)
110
checked on Sep 7, 2022
Download(s)
318
checked on Sep 7, 2022
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.