Part 1a: Extension-based and labelling semantics

Consider the argumentation graph $\mathcal{F} = (A,R)$ with $A = \{a,b,c,d,e\}$ and $R = \{ (b,a), (b,c), (c,b), (c,a), (a,d), (d,e)\}$.

1. Calculate stable, preferred, complete and grounded extensions.
2. For each extension obtained, write the equivalent labelling $Lab$.

Part 1b: Extension-based and labelling semantics

Consider the argumentation graph below.

1. Calculate grounded, stable, preferred, semi-stable, complete and ideal extensions.
2. For each extension obtained, write the equivalent labelling $Lab$.

Part 2: Proof dialogues

Consider the argumentation graph below.