Strong Admissibility (SetAF)
A set is strongly admissible iff is conflict-free and every is defended by some strongly admissible .
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.