Please use this identifier to cite or link to this item:
http://hdl.handle.net/1942/28309Full metadata record
| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Hannula, Miika | - |
| dc.contributor.author | Kontinen, Juha | - |
| dc.contributor.author | VIRTEMA, Jonni | - |
| dc.contributor.author | Vollmer, Heribert | - |
| dc.date.accessioned | 2019-05-28T12:47:20Z | - |
| dc.date.available | 2019-05-28T12:47:20Z | - |
| dc.date.issued | 2018 | - |
| dc.identifier.citation | ACM Transactions on Computational Logic, 19(1) (Art N° 2) | - |
| dc.identifier.issn | 1529-3785 | - |
| dc.identifier.uri | http://hdl.handle.net/1942/28309 | - |
| dc.description.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. | - |
| dc.language.iso | en | - |
| dc.title | Complexity of Propositional Logics in Team Semantics | - |
| dc.type | Journal Contribution | - |
| dc.identifier.issue | 1 | - |
| dc.identifier.volume | 19 | - |
| local.bibliographicCitation.jcat | A1 | - |
| local.type.refereed | Refereed | - |
| local.type.specified | Article | - |
| local.bibliographicCitation.artnr | 2 | - |
| local.class | dsPublValOverrule/author_version_not_expected | - |
| local.class | dsPublValOverrule/internal_author_not_expected | - |
| local.class | IncludeIn-ExcludeFrom-List/ExcludeFromFRIS | - |
| dc.identifier.doi | 10.1145/3157054 | - |
| item.accessRights | Restricted Access | - |
| item.contributor | Hannula, Miika | - |
| item.contributor | Kontinen, Juha | - |
| item.contributor | VIRTEMA, Jonni | - |
| item.contributor | Vollmer, Heribert | - |
| item.fullcitation | Hannula, Miika; Kontinen, Juha; VIRTEMA, Jonni & Vollmer, Heribert (2018) Complexity of Propositional Logics in Team Semantics. In: ACM Transactions on Computational Logic, 19(1) (Art N° 2). | - |
| item.fulltext | With Fulltext | - |
| crisitem.journal.issn | 1529-3785 | - |
| crisitem.journal.eissn | 1557-945X | - |
| Appears in Collections: | Research publications | |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| a2-hannula.pdf Restricted Access | Published version | 250.35 kB | Adobe PDF | View/Open Request a copy |
SCOPUSTM
Citations
27
checked on Jun 25, 2026
WEB OF SCIENCETM
Citations
24
checked on Jun 22, 2026
Google ScholarTM
Check
Altmetric
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.