Conflict-Freeness
A set is conflict-free iff there are no with .
Signature
A set of sets of arguments is in iff , 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.