Complexity of validity for propositional dependence logics
Logic in Computer Science
2016-06-21 v2 Computational Complexity
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 NEXPTIME^NP.
Keywords
Cite
@article{arxiv.1406.6259,
title = {Complexity of validity for propositional dependence logics},
author = {Jonni Virtema},
journal= {arXiv preprint arXiv:1406.6259},
year = {2016}
}
Comments
In Proceedings GandALF 2014, arXiv:1408.5560