Weakly Complete Semantics

A set E⊆AE \subseteq A is a weakly complete extension iff EE is weakly admissible and E′⊆EE' \subseteq E for every E′⊇EE' \supseteq E that EE weakly defends.

Reference

Baumann, R., Brewka, G. & Ulbricht, M. (2020). Revisiting the Foundations of Abstract Argumentation - Semantics Based on Weak Admissibility and Weak Defense. In: Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI 2020), pp. 2742–2749. AAAI Press.

Referenced by