Eager Semantics

A set E⊆AE \subseteq A is the eager extension iff EE is the ⊆\subseteq-maximal admissible set with E⊆⋂E \subseteq \bigcap sst(F)\mathsf{sst}(F).

Signature

A set S\mathbb{S} of sets of arguments is in sig(ea)\mathsf{sig}(\mathsf{ea}) iff ∣S∣=1\lvert\mathbb{S}\rvert = 1 (Dunne et al., 2016).

Reference

Caminada, M. (2007). Comparing Two Unique Extension Semantics for Formal Argumentation: Ideal and Eager. In: Proceedings of the 19th Belgian-Dutch Conference on Artificial Intelligence (BNAIC 2007), pp. 81–87.

Referenced by