Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/28309
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHannula, Miika-
dc.contributor.authorKontinen, Juha-
dc.contributor.authorVIRTEMA, Jonni-
dc.contributor.authorVollmer, Heribert-
dc.date.accessioned2019-05-28T12:47:20Z-
dc.date.available2019-05-28T12:47:20Z-
dc.date.issued2018-
dc.identifier.citationACM Transactions on Computational Logic, 19(1) (Art N° 2)-
dc.identifier.issn1529-3785-
dc.identifier.urihttp://hdl.handle.net/1942/28309-
dc.description.abstractWe 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.isoen-
dc.titleComplexity of Propositional Logics in Team Semantics-
dc.typeJournal Contribution-
dc.identifier.issue1-
dc.identifier.volume19-
local.bibliographicCitation.jcatA1-
local.type.refereedRefereed-
local.type.specifiedArticle-
local.bibliographicCitation.artnr2-
local.classdsPublValOverrule/author_version_not_expected-
local.classdsPublValOverrule/internal_author_not_expected-
local.classIncludeIn-ExcludeFrom-List/ExcludeFromFRIS-
dc.identifier.doi10.1145/3157054-
item.fulltextWith Fulltext-
item.contributorHannula, Miika-
item.contributorKontinen, Juha-
item.contributorVIRTEMA, Jonni-
item.contributorVollmer, Heribert-
item.fullcitationHannula, 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.accessRightsRestricted Access-
crisitem.journal.issn1529-3785-
crisitem.journal.eissn1557-945X-
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 simple item record

Google ScholarTM

Check

Altmetric


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