Complexity of Propositional Independence and Inclusion Logic
DOI10.1007/978-3-662-48057-1_21zbMath1465.68104arXiv1504.06135OpenAlexW1736037452MaRDI QIDQ2946342
Heribert Vollmer, Miika Hannula, Jonni Virtema, Juha Kontinen
Publication date: 16 September 2015
Published in: Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.06135
independencepropositional logicvaliditymodel-checkingsatisfiabilitydependenceteam semanticsinclusion
Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60)
Related Items (11)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Propositional logics of dependence
- Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
- Dependence and independence
- Complexity results for modal dependence logic
- Complexity of Model Checking for Modal Dependence Logic
- Complexity of Propositional Independence and Inclusion Logic
- Modal Inclusion Logic: Being Lax is Simpler than Being Strict
- Alternation
- A Van Benthem Theorem for Modal Team Semantics
- Axiomatizing Propositional Dependence Logics
- A Finite Axiomatization of Conditional Independence and Inclusion Dependencies
- The complexity of theorem-proving procedures
- Team Logic and Second-Order Logic
This page was built for publication: Complexity of Propositional Independence and Inclusion Logic