Semi-Qualified Weak Local Function
The semi-qualified weak local function of an SCC-decomposable semantics computes the labellings of an SCC like the local function of , after relabelling an attacker from outside the SCC as exactly when no other given labelling of these attackers labels it .
Formal definition
Let be the set of possible labellings of the outparents of the current SCC. Then , where if and no labels as , and otherwise (Dauphin et al., 2020).
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.