English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Tools annual

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

The computational properties of modal and propositional dependence logicshave been extensively studied over the past few years, starting from a resultby Sevenster showing NEXPTIME-completeness of the satisfiability problem formodal dependence logic. Thus far, however, the validity and entailmentproperties of these logics have remained mostly unaddressed. This paperprovides a comprehensive classification of the complexity of validity andentailment in various modal and propositional dependence logics. The logicsexamined are obtained by extending the standard modal and propositional logicswith notions of dependence, independence, and inclusion in the team semanticscontext. In particular, we address the question of the complexity of validityin modal dependence logic. By showing that it is NEXPTIME-complete we refute anearlier conjecture proposing a higher complexity for the problem.

Validity and Entailment in Modal and Propositional Dependence Logics