Weakly Complete Semantics (SetAF)

A set $E \subseteq A$ is a weakly complete extension iff $E$ is weakly admissible and $E' \subseteq E$ for every $E' \supseteq E$ that $E$ weakly defends.

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

Weakly Grounded Semantics (SetAF)