On the Complexity of Entailment for Cumulative Propositional Dependence Logics

TL;DR

This paper investigates the computational complexity of entailment problems in cumulative propositional dependence and team semantics logics, providing formal complexity results for these logical systems.

Contribution

It establishes and proves complexity bounds for entailment in cumulative propositional dependence logic and cumulative propositional logic with team semantics.

Findings

Complexity results for entailment in cumulative propositional dependence logic.

Complexity bounds for cumulative propositional logic with team semantics.

Abstract

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.