On the Complexity of Entailment for Cumulative Propositional Dependence Logics
Provides foundational complexity results for entailment in cumulative logics, which are important for understanding reasoning in non-monotonic and team-based logics.
The paper establishes complexity results for entailment in cumulative propositional dependence logic and cumulative propositional logic with team semantics, showing that the problem is complete for the complexity class coNP.
This paper establishes and proves complexity results for entailment for cumulative propositional dependence logic and for cumulative propositional logic with team semantics. As recently shown, cumulative logics are famously characterised by System~C and exactly captured by the cumulative models of Kraus, Lehmann and Magidor. This gives rise to the entailment problem via relational models, which is specifically considered here.