On the Complexity of Entailment for Cumulative Propositional Dependence Logics
Logic in Computer Science
2026-05-21 v1 Artificial Intelligence
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.
Cite
@article{arxiv.2605.21113,
title = {On the Complexity of Entailment for Cumulative Propositional Dependence Logics},
author = {Kai Sauerwald and Juha Kontinen and Arne Meier},
journal= {arXiv preprint arXiv:2605.21113},
year = {2026}
}
Comments
arXiv admin note: substantial text overlap with arXiv:2602.21360