Grounded Semantics

A set E⊆AE \subseteq A is the grounded extension iff EE is a ⊆\subseteq-minimal complete extension. It is the least fixed point of the characteristic function ΔF\Delta_F.

Signature

A set S\mathbb{S} of sets of arguments is in sig(gr)\mathsf{sig}(\mathsf{gr}) iff ∣S∣=1\lvert\mathbb{S}\rvert = 1 (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