Abstract argumentation frameworks (AFs), introduced by Dung, model non-monotonic reasoning through directed attacks between arguments. A key question is how hard it is to compute or decide semantics for these frameworks. The new arXiv paper, announced as arXiv:2610.12008, addresses this question for two important semantics: grounded and preferred.
The abstract notes that decision problems for general infinite AFs typically reside at high levels of the complexity hierarchy. The paper's title indicates a focus on finitary AFs, in which every argument is attacked by and attacks only finitely many other arguments. This restriction is natural for many applications and may lower the complexity of reasoning, but the specific results are not visible in the truncated abstract.
Because the source abstract cuts off mid-sentence, this digest can only report the paper's stated scope and motivation. Readers interested in the precise complexity bounds or the techniques used will need to consult the full arXiv listing.