Complexity of model checking for modal dependence logic

DOI10.1007/978-3-642-27660-6_19MaRDI QIDQ2891371zbMATH OpenOpenAlexFDO

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

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)

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}\)

Cites work

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

Cited in

(24)

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

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)