 On an intuitive level, the basic idea is that the question whether an argument is acceptable concerns the question whether it is defended from its argumentative attacks.  Dung (1995)  proposed a way to address this question purely on the basis of the attack relations between arguments while abstracting from the concrete structure of the given arguments. Where Args is the set of the arguments that are generated from \(\Gamma\) by the rules in SRules and DRules, we define an attack relation \({\leadsto} \subseteq \mathit{Args} \times \mathit{Args}\) as follows: \(a \leadsto b\) if and only if \(a\) attacks (e.g., rebuts or undercuts) \(b\). This gives rise to a directed graph, the abstract argumentation framework, where arguments are nodes and arrows represent the attack relation. Note that at the level of the directed graph arguments are treated in an abstract way: the concrete structure of the arguments is not presented in the graph. 