A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Complexity Results for Modal Dependence Logic
[chapter]
2010
Lecture Notes in Computer Science
Modal dependence logic was introduced very recently by Väänänen. It enhances the basic modal language by an operator dep. For propositional variables p1, . . . , pn, dep(p1, . . . , pn−1; pn) intuitively states that the value of pn only depends on those of p1, . . . , pn−1. Sevenster (J. Logic and Computation, 2009) showed that satisfiability for modal dependence logic is complete for nondeterministic exponential time. In this paper we consider fragments of modal dependence logic obtained by
doi:10.1007/978-3-642-15205-4_32
fatcat:fl5t4ahopvdj3czkl2ccbndc3e