Semi-Qualified Weak Local Function

The semi-qualified weak local function gsq-σg_{\mathsf{sq}\text{-}\sigma} of an SCC-decomposable semantics σ\sigma computes the labellings of an SCC like the local function fσf_\sigma of σ\sigma, after relabelling an undec\mathsf{undec} attacker from outside the SCC as out\mathsf{out} exactly when no other given labelling of these attackers labels it in\mathsf{in}.

Formal definition

Let SinS_{\mathrm{in}} be the set of possible labellings of the outparents of the current SCC. Then gsq-σ((A,R),Ain,Rin,Lin,Sin)=fσ((A,R),Ain,Rin,Lin′)g_{\mathsf{sq}\text{-}\sigma}((A,R), A_{\mathrm{in}}, R_{\mathrm{in}}, L_{\mathrm{in}}, S_{\mathrm{in}}) = f_\sigma((A,R), A_{\mathrm{in}}, R_{\mathrm{in}}, L'_{\mathrm{in}}), where Lin′(x)=outL'_{\mathrm{in}}(x) = \mathsf{out} if Lin(x)=undecL_{\mathrm{in}}(x) = \mathsf{undec} and no L∈SinL \in S_{\mathrm{in}} labels xx as in\mathsf{in}, and Lin′(x)=Lin(x)L'_{\mathrm{in}}(x) = L_{\mathrm{in}}(x) 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.

Referenced by