Strong Admissibility (SetAF)

A set E⊆AE \subseteq A is strongly admissible iff EE is conflict-free and every a∈Ea \in E is defended by some strongly admissible E′⊆E∖{a}E' \subseteq E \setminus \{a\}.

Reference

Berthold, M., Blümel, L. & Rapberger, A. (2025). On Strong and Weak Admissibility in Non-Flat Assumption-Based Argumentation. In: Proceedings of the 22nd International Conference on Principles of Knowledge Representation and Reasoning (KR 2025). ijcai.org.