Paper analyzes entailment complexity in propositional dependence logics

This paper delves into the computational complexity of entailment within cumulative propositional dependence logics and team semantics. It builds upon recent work characterizing these logics by System C and cumulative models, which allows for the analysis of entailment through relational models. AI

Summary written by gemini-2.5-flash-lite from 1 source. How we write summaries →

IMPACT Theoretical analysis of logical systems may inform future AI reasoning capabilities.

RANK_REASON The cluster contains an academic paper detailing theoretical results in logic and computer science. [lever_c_demoted from research: ic=1 ai=0.7]

Read on arXiv cs.AI →

• arXiv
• Kraus, Lehmann and Magidor

• paper
• other