Complexity Results for Modal Dependence Logic

Peter Lohmann, Heribert Vollmer

Abstract: Modal dependence logic was introduced very recently by Väänänen. It enhances the basic modal language by an operator dep. For propositional variables p 1,...,p n , dep(p 1,...,p n − 1)p n intuitively states that the value of p n only depends on those of p 1,...,p n − 1. Sevenster (J. Logic and Computation, 2009) showed that satisfiability for modal dependence logic is complete for nondeterministic exponential time.