Stable Semantics

A set $E \subseteq A$ is a stable extension iff $E$ is conflict-free and $E^\oplus$ $= A$ .

Signature

A set $\mathbb{S}$ of sets of arguments is in $\mathsf{sig}(\mathsf{st})$ iff $\mathbb{S}$ is incomparable and tight (Dunne et al., 2015).

Reference

Dung, P.M. (1995). On the Acceptability of Arguments and its Fundamental Role in Nonmonotonic Reasoning, Logic Programming and n-Person Games. Artificial Intelligence, 77(2), pp. 321–357.

Referenced by

Extension-based Semantics
Serialisation System
Signature