Complexity of validity for propositional dependence logics
DOI10.1016/J.IC.2016.07.008zbMATH Open1362.68114OpenAlexW2963866037MaRDI QIDQ515658FDOQ515658
Authors: Jonni Virtema 
Publication date: 16 March 2017
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2016.07.008
Recommendations
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70)
Cites Work
- Dependence and independence
- Dependence logic. A new approach to independence friendly logic
- Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
- Modal logic
- Compositional semantics for a language of imperfect information
- Propositional dynamic logic of regular programs
- The complexity of theorem-proving procedures
- Complexity results for modal dependence logic
- Extended Modal Dependence Logic $\mathcal{EMDL}$
- Complexity of Model Checking for Modal Dependence Logic
- Automatic verification of finite-state concurrent systems using temporal logic specifications
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Expressive Power of Modal Dependence Logic
- Model Checking for Modal Intuitionistic Dependence Logic
- Lower bounds for multiplayer noncooperative games of incomplete information
- Model-theoretic and computational properties of modal dependence logic
- A remark on negation in dependence logic
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- Models and quantifier elimination for quantified Horn formulas
- Characterising modal definability of team-based logics via the universal modality
- Model Checking for Modal Dependence Logic: An Approach through Post’s Lattice
- Complexity of Propositional Independence and Inclusion Logic
- Modal independence logic:
- Complexity of validity for propositional dependence logics
- A Van Benthem Theorem for Modal Team Semantics
- Dependency Quantified Horn Formulas: Models and Complexity
Cited In (14)
- Expressivity and Complexity of Dependence Logic
- Parameterised complexity of model checking and satisfiability in propositional dependence logic
- Computer Science Logic
- Complexity Results for Modal Dependence Logic
- Characterising modal definability of team-based logics via the universal modality
- Boolean dependence logic and partially-ordered connectives
- Title not available (Why is that?)
- A parameterized view on the complexity of dependence logic
- Parameterized complexity of propositional inclusion and independence logic
- Complexity thresholds in inclusion logic
- A fragment of dependence logic capturing polynomial time
- Title not available (Why is that?)
- Complexity of validity for propositional dependence logics
- Team semantics for the specification and verification of hyperproperties
This page was built for publication: Complexity of validity for propositional dependence logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q515658)
