Preferred Semantics

A set E⊆AE \subseteq A is a preferred extension iff EE is a ⊆\subseteq-maximal complete extension.

Signature

A set S\mathbb{S} of sets of arguments is in sig(pr)\mathsf{sig}(\mathsf{pr}) iff S≠∅\mathbb{S} \neq \emptyset, S\mathbb{S} is incomparable and conflict-sensitive (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