Complexity collapses for other argumentation semantics

Investigate whether complexity collapses analogous to those established for grounded and preferred semantics in computably finitary argumentation frameworks also occur for other argumentation semantics.

Background

The paper shows that the computably finitary restriction lowers the complexity of several decision problems for grounded and preferred semantics, with some problems moving from the analytical hierarchy into the arithmetical hierarchy. It leaves unresolved whether comparable reductions in complexity occur for other semantics.

References

Finally, it remains to investigate whether similar collapses occur for other semantics.

— Complexity of Grounded Semantics and Preferred Semantics in Finitary Argumentation Frameworks  (2610.12008 - Xu et al., 8 Oct 2026) in Section Conclusions