Details
| Originalsprache | Englisch |
|---|---|
| Publikationsstatus | Veröffentlicht - 23 Apr. 2015 |
Abstract
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
2015.
Publikation: Arbeitspapier/Preprint › Arbeitspapier/Diskussionspapier
}
TY - UNPB
T1 - Complexity of Propositional Logics in Team Semantic
AU - Hannula, Miika
AU - Kontinen, Juha
AU - Virtema, Jonni
AU - Vollmer, Heribert
N1 - 15 pages + 1 page appendix, the main result is generalised and the title updated to reflect this
PY - 2015/4/23
Y1 - 2015/4/23
N2 - 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.
AB - 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.
KW - cs.LO
KW - cs.CC
KW - math.LO
U2 - 10.48550/arXiv.1504.06135
DO - 10.48550/arXiv.1504.06135
M3 - Working paper/Discussion paper
BT - Complexity of Propositional Logics in Team Semantic
ER -