Qualified Semantics

Given an SCC-decomposable semantics $\sigma$ , the qualified semantics labels each SCC like $\sigma$ , but treats every attacker from an earlier SCC that is labelled $\mathsf{undec}$ as if it were labelled $\mathsf{out}$ (see qualified local function).

Reference

Dauphin, J., Rienstra, T. & van der Torre, L. (2020). A Principle-Based Analysis of Weakly Admissible Semantics. In: Computational Models of Argument (COMMA 2020), FAIA 326, pp. 167–178. IOS Press.