2000 character limit reached
Complexity of validity for propositional dependence logics (1406.6259v2)
Published 24 Jun 2014 in cs.LO and cs.CC
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 NEXPTIMENP.