Splitting Assumption-Based Argumentation frameworks at the knowledge base level with a parametrized version to reduce computational complexity in reasoning tasks.
Thus, for anya∈ A \E, we show thata∈E + R, i.e.E⊢ R a for someR⊆ R
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.