In this tutorial, we will work around ABA and ABA+ arguments.

Building arguments with ABA

Let us consider the following ABA framework is a tuple $(L,R,A,\bar{\ })$:

• $L = \{a,b,c,q,p,r,s,t\}$
• $R = \{ p \leftarrow q,a ; \\ q \leftarrow; \\ r \leftarrow b,c ; \\ t \leftarrow p,c ;\\ s \leftarrow t \}$
• $A = \{ a , b, c \}$
• $\overline{a} = r, \overline{b} =s, \overline{c} = t$

1. Compute the list of arguments.
2. Compute the list of attacks.
3. What are the complete, preferred, and stable assumption sets?
4. Is the ABA framework circular and/or atomic? Justify.

Re-writing arguments

Let us consider the following circular and non-atomic ABA framework $(L,R,A,\bar{\ })$:

• $L = \{a,b,x,y,z\}$
• $R = \{ y \leftarrow b ; \\ y \leftarrow y; \\ x \leftarrow x ; \\ x \leftarrow a ; \\ z \leftarrow x,y\}$
• $A = \{ a , b \}$