Strong Defence

A set E⊆AE \subseteq A strongly defends a∈Aa \in A iff for every b∈b \in a−a^- there is c∈E∖{a}c \in E \setminus \{a\} with (c,b)∈R(c,b) \in R such that E∖{a}E \setminus \{a\} strongly defends cc.

Reference

Baroni, P. & Giacomin, M. (2007). On Principle-Based Evaluation of Extension-Based Argumentation Semantics. Artificial Intelligence, 171(10–15), pp. 675–700.

Referenced by