Admissibility

A set E⊆AE \subseteq A is admissible iff EE is conflict-free and defends every a∈Ea \in E.

Signature

A set S\mathbb{S} of sets of arguments is in sig(ad)\mathsf{sig}(\mathsf{ad}) iff ∅∈S\emptyset \in \mathbb{S} and S\mathbb{S} is 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