| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4950723 | Information and Computation | 2017 | 13 Pages |
Abstract
We study the complexity of the validity problems of 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 problems for modal dependence logic and extended modal dependence logic coincide. We show containment in NEXPTIMENP, whereas NEXPTIME-hardness follows from the propositional case.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Jonni Virtema,