Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/28311
Full metadata record
DC FieldValueLanguage
dc.contributor.authorHella, Lauri-
dc.contributor.authorKuusisto, Antti-
dc.contributor.authorMeier, Arne-
dc.contributor.authorVIRTEMA, Jonni-
dc.date.accessioned2019-05-28T12:59:57Z-
dc.date.available2019-05-28T12:59:57Z-
dc.date.issued2019-
dc.identifier.citationJOURNAL OF LOGIC AND COMPUTATION, 29(5), p. 605-630-
dc.identifier.issn0955-792X-
dc.identifier.urihttp://hdl.handle.net/1942/28311-
dc.description.abstractPropositional and modal inclusion logic are formalisms that belong to the family of logics based on team semantics. This article investigates the model checking and validity problems of these logics. We identify complexity bounds for both problems, covering both lax and strict team semantics. By doing so, we come close to finalizing the programme that aims to completely classify the complexities of the basic reasoning problems for modal and propositional dependence, independence and inclusion logics.-
dc.language.isoen-
dc.publisherOXFORD UNIV PRESS-
dc.subject.otherInclusion logic-
dc.subject.othermodel checking-
dc.subject.othervalidity problem-
dc.subject.othercomplexity-
dc.subject.otherteam semantics-
dc.titleModel checking and validity in propositional and modal inclusion logics-
dc.typeJournal Contribution-
dc.identifier.epage630-
dc.identifier.issue5-
dc.identifier.spage605-
dc.identifier.volume29-
local.bibliographicCitation.jcatA1-
local.publisher.placeGREAT CLARENDON ST, OXFORD OX2 6DP, ENGLAND-
local.type.refereedRefereed-
local.type.specifiedArticle-
dc.source.typeArticle-
dc.identifier.doi10.1093/logcom/exz008-
dc.identifier.isiWOS:000493111600003-
dc.identifier.eissn-
local.provider.typeWeb of Science-
local.uhasselt.uhpubyes-
item.fulltextWith Fulltext-
item.contributorHella, Lauri-
item.contributorKuusisto, Antti-
item.contributorMeier, Arne-
item.contributorVIRTEMA, Jonni-
item.fullcitationHella, Lauri; Kuusisto, Antti; Meier, Arne & VIRTEMA, Jonni (2019) Model checking and validity in propositional and modal inclusion logics. In: JOURNAL OF LOGIC AND COMPUTATION, 29(5), p. 605-630.-
item.accessRightsOpen Access-
item.validationecoom 2020-
crisitem.journal.issn0955-792X-
crisitem.journal.eissn1465-363X-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
oup-accepted-manuscript-2019.pdfPeer-reviewed author version514.64 kBAdobe PDFView/Open
oup-accepted-manuscript-2019.pdf
  Restricted Access		Published version511.85 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.