Model checking and validity in propositional and modal inclusion logics

DOI10.1093/logcom/exz008zbMath1475.68187OpenAlexW2525499796WikidataQ128198795 ScholiaQ128198795MaRDI QIDQ5213388

Lauri Hella, Jonni Virtema, Arne Meier, Antti Kuusisto

Publication date: 3 February 2020

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1942/28311

zbMATH Keywords

computational complexitymodal logicdecision problemspropositional logicmodel checkingteam semanticsvalidity probleminclusion logic

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Modal logic (including the logic of norms) (03B45) Other nonclassical logic (03B60) Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60)

Related Items (3)

Enumerating teams in first-order team logics ⋮ Parameterized complexity of propositional inclusion and independence logic ⋮ Parameterised complexity of model checking and satisfiability in propositional dependence logic

This page was built for publication: Model checking and validity in propositional and modal inclusion logics