Weak Reinstatement

A semantics σ\sigma satisfies Weak Reinstatement iff for every extension E∈σ(F)E \in \sigma(F) and argument aa: if EE strongly defends aa, then a∈Ea \in E.

Reference

Baroni, P. & Giacomin, M. (2007). On Principle-Based Evaluation of Extension-Based Argumentation Semantics. Artificial Intelligence, 171(10–15), pp. 675–700.