Complexity of Grounded Semantics and Preferred Semantics in Finitary Argumentation Frameworks

Abstract: Abstract argumentation frameworks (AFs) introduced by Dung provide a formal foundation for non-monotonic reasoning in artificial intelligence. While decision problems for general infinite AFs typically reside at high levels of the analytical hierarchy ($Σ<em>1<sup>1$ or $Π_1<sup>1$), restricting the framework to be computably finitary reduces some of the complexity to the arithmetical hierarchy. In this paper, we present a complexity mapping of grounded and preferred semantics in computably finitary AFs across standard decision problems: credulous acceptance ($\Cred$), skeptical acceptance ($\Skep$), extension existence ($\Ex$), uniqueness ($\Uni$), and non-empty existence ($\NE$). For grounded semantics, credulous and skeptical acceptance are already known to be $Σ_1<sup>0$-complete. We show that non-empty existence is also $Σ_1<sup>0$-complete, whereas existence and uniqueness are trivial. These classifications are understood within the domain of valid computably finitary representations. For preferred semantics, using a computably finitely branching computation tree, $\Cred</em>{\pref}$ is shown to be in $Π<em>1<sup>0$-c and $\NE</em>{\pref}$ is $Σ<em>2<sup>0$-c. However, it is insufficient to reduce universal quantification and global uniqueness, leaving $\Skep</em>{\pref}$ in $Π_1<sup>1$ and $\UniPref$ in $Σ_2<sup>1$-c. Our results show the precise boundary where finitarity succeeds to bring reasoning down to the arithmetical hierarchy and where second-order quantification forces problems back into the analytical hierarchy.