Complexity of Entailment in Cumulative Dependence Logics
This paper establishes and proves complexity results for entailment in cumulative propositional dependence logic and cumulative propositional logic with team semantics. Cumulative logics are characterized by System C and captured by cumulative models of Kraus, Lehmann, and Magidor, leading to an entailment problem via relational models.
Key facts
- Paper proves complexity results for entailment in cumulative propositional dependence logic.
- Also covers cumulative propositional logic with team semantics.
- Cumulative logics are characterized by System C.
- They are captured by cumulative models of Kraus, Lehmann, and Magidor.
- Entailment problem is considered via relational models.
- Published on arXiv under Computer Science > Logic in Computer Science.
- Submission history available.
- Current browse context: Logic in Computer Science.
Entities
Institutions
- arXiv