Splitting Assumption-Based Argumentation frameworks at the knowledge base level with a parametrized version to reduce computational complexity in reasoning tasks.
If (a) holds, we getR⊆ R 2 andE=E 2 ⊢R a whereE 2 ⊆ A ′ 2 anda∈ A ′
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.