Complexity of validity for propositional dependence logics
Jonni Virtema (Japan Advanced Institute of Science, Technology and, University of Tampere)
TL;DR
This paper investigates the computational complexity of the validity problem in various propositional and modal dependence logics, establishing precise complexity bounds for each logic type.
Contribution
It provides the first complexity classifications for the validity problem in propositional, modal, and extended modal dependence logics.
Findings
Validity for propositional dependence logic is NEXPTIME-complete.
Validity for modal dependence logic is NEXPTIME-hard and in NEXPTIME^NP.
Extended modal dependence logic shares similar complexity bounds.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.