Weak Defence (SetAF)

A set E⊆AE \subseteq A weakly defends E′⊆AE' \subseteq A iff for every (T,h)∈R(T, h) \in R with h∈E′h \in E', either EE attacks some argument in TT, or T⊈E∪E∗T \not\subseteq E \cup E^* for every E∗∈wad(E^* \in \mathsf{wad}(SES^E)), and E′⊆E′′E' \subseteq E'' for some weakly admissible E′′E''.

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.

Referenced by