Splitting Assumption-Based Argumentation frameworks at the knowledge base level with a parametrized version to reduce computational complexity in reasoning tasks.
Proof.For notational convenience, letE=E 1 ∪E 2 and letD ′ 2 = (L 2,R ′ 2,A 2, 2)be the reduct ofD 2 w.r.t.E 1 = E∩ A 1
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.