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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
