Unchallenged Semantics

The unchallenged extensions of $F$ are $\mathcal{E}_{\alpha_{\mathsf{uc}},\beta_{\mathsf{uc}}}(F)$ , with the selection function $\alpha_{\mathsf{uc}}$ and the termination function $\beta_{\mathsf{uc}}$ .

Reference

Bengel, L. & Thimm, M. (2022). Serialisable Semantics for Abstract Argumentation. In: Computational Models of Argument (COMMA 2022), FAIA 353, pp. 80–91. IOS Press.

Referenced by

Extension-based Semantics
Serialisation System