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.

翻译：本文建立并证明了关于累积命题依赖逻辑以及带团队语义的累积命题逻辑的蕴含复杂性结果。正如最近研究所表明，累积逻辑以系统C为特征闻名，并精确地由Kraus、Lehmann和Magidor的累积模型所刻画。这通过关系模型引出了蕴含问题，本文正是对此进行了专门探讨。