Splitting Assumption-Based Argumentation frameworks at the knowledge base level with a parametrized version to reduce computational complexity in reasoning tasks.
IfS̸⊆E 1, then(S∩A ′ 2, t)∈R ′ 2 becauseS∩A ′ 2 ̸=∅, t∈A ′ 2,S∩A 1 ⊆E 1 andS∩(E 1)+ R1∪R3 =∅
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.