pith. sign in

Finally, whenever for a link(T, h)∈R 3 withT∩A 1 ⊆Ewe add an attack(T∩A ′ 2, h)∈R ′ 2 when constructing the reduct, we also obtain(T∩A ′ 2)∪ {h} ̸⊆E since otherwiseT∪{h} ⊆E

Moreover, byE∈cf(SF)we know for each(T, h)∈R 2 thatT∪ {h} ̸⊆Ewhich carries over toSF ′ 2, since the attacks inR 2 may be removed, but are never changed

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

fields

cs.AI 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Splitting Assumption-Based Argumentation Frameworks

cs.AI · 2026-04-30 · unverdicted · novelty 7.0

Splitting Assumption-Based Argumentation frameworks at the knowledge base level with a parametrized version to reduce computational complexity in reasoning tasks.

citing papers explorer

Showing 1 of 1 citing paper.

  • Splitting Assumption-Based Argumentation Frameworks cs.AI · 2026-04-30 · unverdicted · none · ref 8

    Splitting Assumption-Based Argumentation frameworks at the knowledge base level with a parametrized version to reduce computational complexity in reasoning tasks.