Weak Admissibility (SetAF)
A set is weakly admissible iff is conflict-free and for every and every with and , where .
Reference
Blümel, L., König, M. & Ulbricht, M. (2024). Weak Admissibility for ABA via Abstract Set-Attacks. In: Proceedings of the 21st International Conference on Principles of Knowledge Representation and Reasoning (KR 2024), pp. 178–188. ijcai.org.