Naive Semantics

A set E⊆AE \subseteq A is a naive extension iff EE is a ⊆\subseteq-maximal conflict-free set.

Signature

A set S\mathbb{S} of sets of arguments is in sig(na)\mathsf{sig}(\mathsf{na}) iff S≠∅\mathbb{S} \neq \emptyset, S\mathbb{S} is incomparable and dclS\mathrm{dcl}_\mathbb{S} is tight (Dunne et al., 2015).

Reference

Baroni, P., Giacomin, M. & Guida, G. (2005). SCC-Recursiveness: A General Schema for Argumentation Semantics. Artificial Intelligence, 168(1–2), pp. 162–210.

Referenced by