Meaningless Reduct

A semantics $\sigma$ satisfies Meaningless Reduct iff $E \in \sigma(F)$ implies $\sigma(F^E) = \{\emptyset\}$ .

Reference

Baumann, R., Brewka, G. & Ulbricht, M. (2020). Comparing Weak Admissibility Semantics to their Dung-style Counterparts – Reduct, Modularization, and Strong Equivalence in Abstract Argumentation. In: Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR 2020), pp. 79–88. ijcai.org.