Semi-Stable Semantics

A set E⊆AE \subseteq A is a semi-stable extension iff EE is complete and there is no complete extension E′E' with E⊕E^\oplus ⊊E′⊕\subsetneq E'^\oplus.

Signature

A set S\mathbb{S} of sets of arguments is in sig(sst)\mathsf{sig}(\mathsf{sst}) iff S≠∅\mathbb{S} \neq \emptyset, S\mathbb{S} is incomparable and conflict-sensitive (Dunne et al., 2015).

Reference

Caminada, M. (2006). Semi-Stable Semantics. In: Computational Models of Argument (COMMA 2006), FAIA 144, pp. 121–130. IOS Press.

Referenced by