On the Complexity of Entailment for Cumulative Propositional Dependence Logics
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866913149379149824 |
|---|---|
| author | Sauerwald, Kai Kontinen, Juha Meier, Arne |
| author_facet | Sauerwald, Kai Kontinen, Juha Meier, Arne |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_21113 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | On the Complexity of Entailment for Cumulative Propositional Dependence Logics Sauerwald, Kai Kontinen, Juha Meier, Arne Logic in Computer Science Artificial Intelligence 03B70, 03B62 I.2.3; F.4.1 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. |
| title | On the Complexity of Entailment for Cumulative Propositional Dependence Logics |
| topic | Logic in Computer Science Artificial Intelligence 03B70, 03B62 I.2.3; F.4.1 |
| url | https://arxiv.org/abs/2605.21113 |