Reduct Admissibility

A semantics σ\sigma satisfies Reduct Admissibility iff for every E∈σ(F)E \in \sigma(F), no attacker of EE is in an extension of the reduct FEF^E.

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.