Model checking for modal intuitionistic dependence logic

DOI10.1007/978-3-642-36976-6_15MaRDI QIDQ4914522zbMATH OpenOpenAlexFDO

Authors Johannes Ebbing, Peter Lohmann, Fan Yang

Publication date 12 April 2013

Published in Logic, Language, and Computation (Search for Journal in Brave)

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

zbMATH Keywords

computational complexitymodel checkingintuitionistic logicmodal logicdependence logic

Mathematics Subject Classification ID

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 of model checking for modal dependence logic
• Model-theoretic and computational properties of modal dependence logic
• Complexity Results for Modal Dependence Logic
• Model checking for modal dependence logic: an approach through Post's lattice
• Complexity results for modal dependence logic

Cited in

(12)

• Model checking for symbolic-heap separation logic with inductive predicates
• Universal guards, relativization of quantifiers, and failure models in model checking modulo theories
• Intuitionistic implication makes model checking hard
• Propositional logics of dependence
• Model checking for modal dependence logic: an approach through Post's lattice
• Modal independence logic
• Modal indepence logic
• The Complexity of Model Checking for Intuitionistic Logics and Their Modal Companions
• A note on model checking the modal \(\nu\)-calculus
• Complexity of model checking for modal dependence logic
• Complexity of validity for propositional dependence logics
• Propositional team logics

This page was built for publication: Model checking for modal intuitionistic dependence logic

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