Conflict-Freeness

A set E⊆AE \subseteq A is conflict-free iff there are no a,b∈Ea,b \in E with (a,b)∈R(a,b) \in R.

Signature

A set S\mathbb{S} of sets of arguments is in sig(cf)\mathsf{sig}(\mathsf{cf}) iff S≠∅\mathbb{S} \neq \emptyset, S\mathbb{S} is downward-closed 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