Weak Defence

A set $E \subseteq A$ weakly defends $E' \subseteq A$ iff for every $b \in$ $E'^-$ , either $E$ attacks $b$ , or $b \notin E$ , $b \notin \bigcup \mathsf{wad}($ $F^E$ $)$ , and $E' \subseteq E''$ for some weakly admissible $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