Semi-Qualified Semantics

Given an SCC-decomposable semantics $\sigma$ , the semi-qualified semantics labels each SCC like $\sigma$ , but treats an attacker from an earlier SCC that is labelled $\mathsf{undec}$ as $\mathsf{out}$ exactly when no other labelling of these attackers labels it $\mathsf{in}$ (see semi-qualified weak 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.