Splitting Assumption-Based Argumentation frameworks at the knowledge base level with a parametrized version to reduce computational complexity in reasoning tasks.
Proof.(1.) We need to show for each(T, h)∈R 1 ∪R 2 ∪ R3 thatT∪ {h} ̸⊆E=E 1 ∪E 2
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Splitting Assumption-Based Argumentation Frameworks
Splitting Assumption-Based Argumentation frameworks at the knowledge base level with a parametrized version to reduce computational complexity in reasoning tasks.