Deciding argument strength comparison under discussion-based semantics is polynomial-time decidable via reduction to semiring automata equivalence.
Systems of distinct repre- sentatives and linear algebra.Journal of Research of the National Bureau of Standards, 71B(4):241–245
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.