Model checking and validity in propositional and modal inclusion logics

Visa fullständig post



Permalänk

http://hdl.handle.net/10138/299557

Citation

Hella , L , Kuusisto , A , Meier , A & Virtema , J 2017 , Model checking and validity in propositional and modal inclusion logics . in K G Larsen , H L Bodlaender & J-F Raskin (eds) , 42nd International Symposium on Mathematical Foundations of Computer Science . , 32 , Leibniz International Proceedings in Informatics , vol. 83 , Schloss Dagstuhl - Leibniz-Zentrum für Informatik , Wadern , International Symposium on Mathematical Foundations of Computer Science , Aalborg , Denmark , 21/08/2017 . https://doi.org/10.4230/LIPIcs.MFCS.2017.32

Titel: Model checking and validity in propositional and modal inclusion logics
Författare: Hella, Lauri; Kuusisto, Antti; Meier, Arne; Virtema, J.
Medarbetare: Larsen, Kim G.
Bodlaender, Hans L.
Raskin, Jean-Francois
Upphovmannens organisation: Department of Mathematics and Statistics
Utgivare: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Datum: 2017
Språk: eng
Sidantal: 14
Tillhör serie: 42nd International Symposium on Mathematical Foundations of Computer Science
Tillhör serie: Leibniz International Proceedings in Informatics
ISBN: 978-3-95977-046-0
ISSN: 1868-8969
DOI: https://doi.org/10.4230/LIPIcs.MFCS.2017.32
Permanenta länken (URI): http://hdl.handle.net/10138/299557
Abstrakt: Propositional 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 finalising the programme that ultimately aims to classify the complexities of the basic reasoning problems for modal and propositional dependence, independence, and inclusion logics.
Subject: Computer circuits
Semantics, Complexity
Complexity bounds
Reasoning problems, Model checking
111 Mathematics
113 Computer and information sciences
Referentgranskad: Ja
Licens: cc_by
Användningsbegränsning: openAccess
Parallelpublicerad version: publishedVersion


Filer under denna titel

Totalt antal nerladdningar: Laddar...

Filer Storlek Format Granska
DIS2017_006.pdf 511.5Kb PDF Granska/Öppna

Detta dokument registreras i samling:

Visa fullständig post