Complexity results for modal dependence logic
CSL'10/EACSL'10 Proceedings of the 24th international conference/19th annual conference on Computer science logic
Complexity of model checking for modal dependence logic
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Model checking for modal intuitionistic dependence logic
TbiLLC'11 Proceedings of the 9th international conference on Logic, Language, and Computation
Complexity Results for Modal Dependence Logic
Studia Logica
The Dynamification of Modal Dependence Logic
Journal of Logic, Language and Information
Hi-index | 0.00 |
We study the basic modal language extended by an operator dep. If pi are propositional atoms, then dep(p1,…,pn−1;pn) expresses, intuitively, that pn only depends on p1,…,pn−1. The resulting language was baptized ‘modal dependence logic’ by Väänänen in his paper Modal Dependence Logic. The current article compares modal dependence logic with basic modal logic in terms of its model-theoretic and computational properties. We show that modal dependence logic is strictly more expressive than modal logic, but that under special conditions modal dependence logic can be translated into basic modal logic.We show that the complexity of modal dependence logic is NEXP-complete.