Deciding argument strength comparison under discussion-based semantics is polynomial-time decidable via reduction to semiring automata equivalence.
Notes on equivalence and min- imization of weighted automata.CoRR, abs/2009.01217
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
New randomized reductions and faster algorithms for XNFA decision problems under polynomial or bounded ambiguity, extending to other semirings.
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.
-
Algorithms and fine-grained complexity for nondeterministic and symmetric difference automata
New randomized reductions and faster algorithms for XNFA decision problems under polynomial or bounded ambiguity, extending to other semirings.