Complexity of model checking for modal dependence logic

DOI10.1007/978-3-642-27660-6_19zbMATH Open1298.68170OpenAlexW2137379463MaRDI QIDQ2891371FDOQ2891371

Authors: Johannes Ebbing, Peter Lohmann 

Publication date: 15 June 2012

Published in: SOFSEM 2012: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-27660-6_19

Recommendations

• Complexity Results for Modal Dependence Logic
• Complexity results for modal dependence logic
• Model-theoretic and computational properties of modal dependence logic
• Model checking for modal intuitionistic dependence logic
• Extended modal dependence logic \(\mathcal{EMDL}\)

zbMATH Keywords

computational complexitymodel checkingmodal logicdependence logic

Mathematics Subject Classification ID

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) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Dependence logic. A new approach to independence friendly logic
• Automatic verification of finite-state concurrent systems using temporal logic specifications
• Modal dependence logic
• Model checking for modal intuitionistic dependence logic
• Model-theoretic and computational properties of modal dependence logic
• Satisfiability problems for propositional calculi
• Generalized modal satisfiability
• Model Checking CTL is Almost Always Inherently Sequential
• Complexity Results for Modal Dependence Logic
• The complexity of poor man's logic

Cited In (25)

• Expressivity and Complexity of Dependence Logic
• Complexity of model checking for logics over Kripke models
• Parameterised complexity of model checking and satisfiability in propositional dependence logic
• Model checking for modal dependence logic: an approach through Post's lattice
• Propositional logics of dependence
• Modal indepence logic
• Complexity Results for Modal Dependence Logic
• The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions
• Boolean dependence logic and partially-ordered connectives
• Title not available (Why is that?)
• Complexity of Propositional Independence and Inclusion Logic
• Extended modal dependence logic \(\mathcal{EMDL}\)
• Model checking for modal intuitionistic dependence logic
• Complexity results for modal dependence logic
• Parameterized complexity of propositional inclusion and independence logic
• Transition semantics: the dynamics of dependence logic
• Model-theoretic and computational properties of modal dependence logic
• Complexity of model checking for cardinality-based belief revision operators
• Coherence and computational complexity of quantifier-free dependence logic formulas
• The Data Complexity of MDatalog in Basic Modal Logics
• The expressive power of modal logic with inclusion atoms
• Title not available (Why is that?)
• Complexity of validity for propositional dependence logics
• Mathematical Foundations of Computer Science 2005
• Propositional team logics

This page was built for publication: Complexity of model checking for modal dependence logic

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2891371)