Model Checking and Validity in Propositional and Modal Inclusion Logics

DOI10.4230/LIPIcs.MFCS.2017.32zbMath1441.68132arXiv1609.06951OpenAlexW3093094759MaRDI QIDQ5111246

Arne Meier, Antti Kuusisto, Lauri Hella, Jonni Virtema

Publication date: 26 May 2020

Full work available at URL: https://arxiv.org/abs/1609.06951

zbMATH Keywords

complexitymodel checkinginclusion logic

Mathematics Subject Classification ID

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

Related Items (5)

Propositional union closed team logics ⋮ The expressive power of \(k\)-ary exclusion logic ⋮ Canonical Models and the Complexity of Modal Team Logic ⋮ Unnamed Item ⋮ Model Checking and Validity in Propositional and Modal Inclusion Logics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
• Dependence and independence
• Characterising modal definability of team-based logics via the universal modality
• Characterizing Relative Frame Definability in Team Semantics via the Universal Modality
• Complexity of Propositional Independence and Inclusion Logic
• Modal Inclusion Logic: Being Lax is Simpler than Being Strict
• Hierarchies in independence logic
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• Compositional semantics for a language of imperfect information
• Complexity of Propositional Logics in Team Semantic
• The expressive power of modal logic with inclusion atoms
• Model Checking and Validity in Propositional and Modal Inclusion Logics
• Expressivity and Complexity of Dependence Logic
• Hierarchies in independence and inclusion logic with strict semantics
• The complexity of theorem-proving procedures
• Lower bounds for multiplayer noncooperative games of incomplete information

This page was built for publication: Model Checking and Validity in Propositional and Modal Inclusion Logics