Weak Admissibility (SetAF)

A set E⊆AE \subseteq A is weakly admissible iff EE is conflict-free and T∩A′⊈E′T \cap A' \not\subseteq E' for every E′∈wad(E' \in \mathsf{wad}(SES^E)) and every (T,h)∈R(T, h) \in R with h∈Eh \in E and T∩T \cap ER+E^+_R =∅= \emptyset, where SE=(A′,R′)S^E = (A', R').

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