Loading...
Please wait, while we are loading the content...
Similar Documents
Complexity of Propositional Logics in Team Semantics
| Content Provider | Semantic Scholar |
|---|---|
| Author | Hannula, Miika Kontinen, Juha Virtema, Jonni Vollmer, Heribert |
| Copyright Year | 2015 |
| 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. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | https://helda.helsinki.fi//bitstream/handle/10138/233124/PLcomp.pdf?sequence=1 |
| Alternate Webpage(s) | http://research.cs.aalto.fi/cl/clday16/slides/virtema.pdf |
| Alternate Webpage(s) | https://arxiv.org/pdf/1504.06135v2.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |