Deciding argument strength comparison under discussion-based semantics is polynomial-time decidable via reduction to semiring automata equivalence.
On the acceptability of argu- ments and its fundamental role in nonmonotonic reasoning, logic programming and n-person games.Artificial Intelli- gence, 77(2):321–358
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
-
On the Complexity of the Discussion-based Semantics in Abstract Argumentation
Deciding argument strength comparison under discussion-based semantics is polynomial-time decidable via reduction to semiring automata equivalence.