Instantiated SetAF

For a flat ABAF D=(L,R,A,a‾)D = (\mathcal{L}, \mathcal{R}, \mathcal{A}, \overline{\phantom{a}}), the corresponding SetAF is SD=(A,R)S_D = (\mathcal{A}, R) with R={(T,h)∣h∈A, T⊆A, T⊢h‾}R = \{(T, h) \mid h \in \mathcal{A},\ T \subseteq \mathcal{A},\ T \vdash \overline{h}\}, where ⊢\vdash is tree-derivability.

Reference

König, M., Rapberger, A. & Ulbricht, M. (2022). Just a Matter of Perspective: Intertranslating Expressive Argumentation Formalisms. In: Computational Models of Argument (COMMA 2022), FAIA 353, pp. 212–223. IOS Press.