Weak Admissibility

A set $E \subseteq A$ is weakly admissible iff $E$ is conflict-free and $b \notin \bigcup \mathsf{wad}($ $F^E$ $)$ for every $b \in$ $E^-$ .

Reference

Baumann, R., Brewka, G. & Ulbricht, M. (2020). Revisiting the Foundations of Abstract Argumentation - Semantics Based on Weak Admissibility and Weak Defense. In: Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI 2020), pp. 2742–2749. AAAI Press.

Referenced by

Weakly Complete Semantics
Weakly Preferred Semantics
Extension-based Semantics
Weak Defence