Complexity of Propositional Logics in Team Semantics
Logic in Computer Science
2017-01-06 v2 Computational Complexity
Logic
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.
Cite
@article{arxiv.1504.06135,
title = {Complexity of Propositional Logics in Team Semantics},
author = {Miika Hannula and Juha Kontinen and Jonni Virtema and Heribert Vollmer},
journal= {arXiv preprint arXiv:1504.06135},
year = {2017}
}
Comments
15 pages + 1 page appendix, the main result is generalised and the title updated to reflect this