Complexity of validity for propositional dependence logics

Abstract

We study the validity problem for propositional dependence logic, modal dependence logic and extended modal dependence logic. We show that the validity problem for propositional dependence logic is NEXPTIME-complete. In addition, we establish that the corresponding problem for modal dependence logic and extended modal dependence logic is NEXPTIME-hard and in NEXPTIME^NP.

In Proceedings GandALF 2014, arXiv:1408.5560

Cited by in corpus (2)

• The expressive power of modal logic with inclusion atoms
• On Quantified Propositional Logics and the Exponential Time Hierarchy