Input Formats for diverse Argumentation Formalisms
Dung AFs
AFs are encoded by a sequence of statements that either encode an arguments or an attack of the AF.
For instance consider the following argument graph.
| AF | Input File |
|---|---|
 |
arg(a).
arg(b).
arg(c).
att(a,b).
att(b,a).
att(c,b).
|
References
| [1] |
Answer-Set Programming Encodings for Argumentation Frameworks.
Uwe Egly, Sarah Gaggl, and Stefan Woltran. Technical Report DBAI-TR-2008-62, Technische Universität Wien, 2008 [.pdf] |
EAF
Extended argumentation frameworks (EAFs) extend Dung's argumentation frameworks (AFs) by incorporating to the argument-attack structure also attacks on attacks. EAFs are encoded by a sequence of statements that either encode an arguments, an attack between arguments, or an attack on a attack.
For instance consider the following argument graph.
| EAF | Input File |
|---|---|
 |
arg(a).
arg(b).
arg(c).
arg(d).
arg(e).
att(a,c).
att(b,d).
att(c,e).
att(d,e).
d(c,b,d).
d(d,a,c).
|
More examples at the GERD system page.
References
| [2] |
Reduction-based Approaches to Implement Modgil's Extended Argumentation Frameworks. Wolfgang Dvořák, Sarah Alice Gaggl, Thomas Linsbichler, and Johannes Peter Wallner Advances in Knowledge Representation, Logic Programming, and Abstract Argumentation 2015: 249-264 |
AFRA
Argumentation frameworks with recursive attacks (AFRas) extend Dung's argumentation frameworks (AFs) by incorporating to the argument-attack structure also attacks on attacks, and in a recursive fashion also attacks on attacks on attacks. AFRAs are encoded by a sequence of statements that either encode an arguments, an attack between arguments, or an attack on a attack.
For instance consider the following argument graph.
| EAF | Input File |
|---|---|
 |
afraA(a).
afraA(n).
afraA(p).
afraA(c).
afraA(g).
afraR(epsilon,a,n).
afraR(delta,n,gamma).
afraR(gamma,p,beta).
afraR(beta,c,g).
afraR(alpha,g,c).
|
References
SETAFs
SETAFs are encoded by a sequence of statements that either encode an argument, the target of an attack, or the support of an attack.
| SETAF | Input File |
|---|---|
SETAF F=(A,R) with
That is we have three arguments a,b,c and three attacks r1=({a,b},c), r2=({a,c},b), r3=({b,c},a). |
arg(a).
arg(b).
arg(c).
att(r1,c).
mem(r1,a).
mem(r1,b).
att(r2,b).
mem(r2,a).
mem(r2,c).
att(r3,a).
mem(r3,b).
mem(r3,c).
|
Claim-augmented AFs (CAFs)
AFs with claims are encoded by a sequence of statements that either encode an argument, an argument together with its claim, or an attack between arguments.
References
Well-formed CAFs
Well-formed AFs with claims are encoded by a sequence of statements that either encode an argument, an argument together with its claim, or attacks from all arguments with a specific claim.