Complete Semantics
A set is a complete extension iff is admissible and for every argument defended by , we have .
Signature
An exact characterisation of is open. Every has , is com-closed and contains , but not every such is in (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.