Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/28309
Title: Complexity of Propositional Logics in Team Semantics
Authors: Hannula, Miika
Kontinen, Juha
VIRTEMA, Jonni 
Vollmer, Heribert
Issue Date: 2018
Source: ACM Transactions on Computational Logic, 19(1) (Art N° 2)
Abstract: We classify the computational complexity of the satisfiability, validity, and model-checking problems for propositional independence, inclusion, and team logic. Our main result shows that the satisfiability and validity problems for propositional team logic are complete for alternating exponential-time with polynomially many alternations.
Document URI: http://hdl.handle.net/1942/28309
ISSN: 1529-3785
e-ISSN: 1557-945X
DOI: 10.1145/3157054
Category: A1
Type: Journal Contribution
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
a2-hannula.pdf
  Restricted Access		Published version250.35 kBAdobe PDFView/Open    Request a copy
Show full item record

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.