abstract argumentation - introduction to formal ...2… · parmenides-system for e-democracy:...
TRANSCRIPT
Artificial Intelligence, Computational Logic
ABSTRACT ARGUMENTATION
Introduction to Formal Argumentation∗
slides adapted from Stefan Woltran’s lecture on Abstract Argumentation
Sarah Gaggl
Dresden, 14th September 2015
Outline
1 Argumentation in History
2 Argumentation Nowadays
3 Introduction
4 Abstract Argumentation
5 Complexity of Abstract Argumentation
6 Argumentation Systems
7 Exercises
TU Dresden, 14th September 2015 Abstract Argumentation slide 2 of 115
Argumentation in History
Plato’s DialecticThe dialectical method is discourse between two or morepeople holding different points of view about a subject, whowish to establish the truth of the matter guided by reasonedarguments.The Republic (Plato), 348b
Leibniz’ Dream“The only way to rectify our reasonings is to make themas tangible as those of the Mathematicians, so that wecan find our error at a glance, and when there aredisputes among persons, we can simply say: Let uscalculate [calculemus], without further ado, to see whois right.”Leibniz, Gottfried Wilhelm, The Art of Discovery 1685, Wiener 51
TU Dresden, 14th September 2015 Abstract Argumentation slide 3 of 115
Argumentation in History
Plato’s DialecticThe dialectical method is discourse between two or morepeople holding different points of view about a subject, whowish to establish the truth of the matter guided by reasonedarguments.The Republic (Plato), 348b
Leibniz’ Dream“The only way to rectify our reasonings is to make themas tangible as those of the Mathematicians, so that wecan find our error at a glance, and when there aredisputes among persons, we can simply say: Let uscalculate [calculemus], without further ado, to see whois right.”Leibniz, Gottfried Wilhelm, The Art of Discovery 1685, Wiener 51
TU Dresden, 14th September 2015 Abstract Argumentation slide 4 of 115
Outline
1 Argumentation in History
2 Argumentation Nowadays
3 Introduction
4 Abstract Argumentation
5 Complexity of Abstract Argumentation
6 Argumentation Systems
7 Exercises
TU Dresden, 14th September 2015 Abstract Argumentation slide 5 of 115
Argumentation Nowadays
Abstract Argumentation [Dung, 1995]• In abstract argumentation frameworks (AFs) statements (called
arguments) are formulated together with a relation (attack) between them.• Abstraction from the internal structure of the arguments.• The conflicts between the arguments are resolved on the semantical level.
TU Dresden, 14th September 2015 Abstract Argumentation slide 6 of 115
Argumentation Nowadays
Abstract Argumentation [Dung, 1995]• In abstract argumentation frameworks (AFs) statements (called
arguments) are formulated together with a relation (attack) between them.• Abstraction from the internal structure of the arguments.• The conflicts between the arguments are resolved on the semantical level.
TU Dresden, 14th September 2015 Abstract Argumentation slide 7 of 115
Argumentation Nowadays
Abstract Argumentation [Dung, 1995]• In abstract argumentation frameworks (AFs) statements (called
arguments) are formulated together with a relation (attack) between them.• Abstraction from the internal structure of the arguments.• The conflicts between the arguments are resolved on the semantical level.
TU Dresden, 14th September 2015 Abstract Argumentation slide 8 of 115
Argumentation Nowadays
Abstract Argumentation [Dung, 1995]• In abstract argumentation frameworks (AFs) statements (called
arguments) are formulated together with a relation (attack) between them.• Abstraction from the internal structure of the arguments.• The conflicts between the arguments are resolved on the semantical level.
TU Dresden, 14th September 2015 Abstract Argumentation slide 9 of 115
Argumentation Nowadays
Abstract Argumentation [Dung, 1995]• In abstract argumentation frameworks (AFs) statements (called
arguments) are formulated together with a relation (attack) between them.• Abstraction from the internal structure of the arguments.• The conflicts between the arguments are resolved on the semantical level.
TU Dresden, 14th September 2015 Abstract Argumentation slide 10 of 115
Argumentation Nowadays
Abstract Argumentation [Dung, 1995]• In abstract argumentation frameworks (AFs) statements (called
arguments) are formulated together with a relation (attack) between them.• Abstraction from the internal structure of the arguments.• The conflicts between the arguments are resolved on the semantical level.
TU Dresden, 14th September 2015 Abstract Argumentation slide 11 of 115
Argumentation Nowadays
Abstract Argumentation [Dung, 1995]• In abstract argumentation frameworks (AFs) statements (called
arguments) are formulated together with a relation (attack) between them.• Abstraction from the internal structure of the arguments.• The conflicts between the arguments are resolved on the semantical level.
TU Dresden, 14th September 2015 Abstract Argumentation slide 12 of 115
Legal Reasoning
TU Dresden, 14th September 2015 Abstract Argumentation slide 13 of 115
Decision Support
TU Dresden, 14th September 2015 Abstract Argumentation slide 14 of 115
Social Networks
TU Dresden, 14th September 2015 Abstract Argumentation slide 15 of 115
Roadmap for the Lecture
Monday • Introduction• Abstract Argumentation Frameworks• Semantics• Computational Complexity
Tuesday • Expressiveness of AFs• Realizability• Intertranslatability
Wednesday • Notions of Equivalence
Thursday • Argumentation and Answer-Set Programming (ASP)
TU Dresden, 14th September 2015 Abstract Argumentation slide 16 of 115
Outline
1 Argumentation in History
2 Argumentation Nowadays
3 Introduction
4 Abstract Argumentation
5 Complexity of Abstract Argumentation
6 Argumentation Systems
7 Exercises
TU Dresden, 14th September 2015 Abstract Argumentation slide 17 of 115
Introduction
Argumentation:. . . the study of processes “concerned with how assertions are proposed,discussed, and resolved in the context of issues upon which several divergingopinions may be held”.[Bench-Capon and Dunne, Argumentation in AI, AIJ 171:619-641, 2007]
Formal Models of Argumentation are concerned with• representation of an argument• representation of the relationship between arguments• solving conflicts between the arguments (“acceptability”)
TU Dresden, 14th September 2015 Abstract Argumentation slide 18 of 115
Introduction
Argumentation:. . . the study of processes “concerned with how assertions are proposed,discussed, and resolved in the context of issues upon which several divergingopinions may be held”.[Bench-Capon and Dunne, Argumentation in AI, AIJ 171:619-641, 2007]
Formal Models of Argumentation are concerned with• representation of an argument• representation of the relationship between arguments• solving conflicts between the arguments (“acceptability”)
TU Dresden, 14th September 2015 Abstract Argumentation slide 19 of 115
Introduction (ctd.)
Increasingly important area• “Argumentation” as keyword at all major AI conferences• dedicated conference: COMMA, TAFA workshop; and several more
workshops• specialized journal: Argument and Computation (Taylor & Francis)• two text books:
• Besnard, Hunter: Elements of Argumentation. MIT Press, 2008• Rahwan, Simari (eds.): Argumentation in Artificial Intelligence.
Springer, 2009.
Applications• PARMENIDES-system for E-Democracy: facilitates structured arguments
over a proposed course of action [Atkinson et al.; 2006]• IMPACT project: argumentation toolbox for supporting open, inclusive and
transparent deliberations about public policy• Decision support systems, etc.• See also http://comma2014.arg.dundee.ac.uk/demoprogram.
TU Dresden, 14th September 2015 Abstract Argumentation slide 20 of 115
Introduction (ctd.)
Increasingly important area• “Argumentation” as keyword at all major AI conferences• dedicated conference: COMMA, TAFA workshop; and several more
workshops• specialized journal: Argument and Computation (Taylor & Francis)• two text books:
• Besnard, Hunter: Elements of Argumentation. MIT Press, 2008• Rahwan, Simari (eds.): Argumentation in Artificial Intelligence.
Springer, 2009.
Handbook of Formal Argumentation HOFA• http://formalargumentation.org
• Volume 1 to appear in 2016
Applications• PARMENIDES-system for E-Democracy: facilitates structured arguments
over a proposed course of action [Atkinson et al.; 2006]• IMPACT project: argumentation toolbox for supporting open, inclusive and
transparent deliberations about public policy• Decision support systems, etc.• See also http://comma2014.arg.dundee.ac.uk/demoprogram.
TU Dresden, 14th September 2015 Abstract Argumentation slide 21 of 115
Introduction (ctd.)
Increasingly important area• “Argumentation” as keyword at all major AI conferences• dedicated conference: COMMA, TAFA workshop; and several more
workshops• specialized journal: Argument and Computation (Taylor & Francis)• two text books:
• Besnard, Hunter: Elements of Argumentation. MIT Press, 2008• Rahwan, Simari (eds.): Argumentation in Artificial Intelligence.
Springer, 2009.
Applications• PARMENIDES-system for E-Democracy: facilitates structured arguments
over a proposed course of action [Atkinson et al.; 2006]• IMPACT project: argumentation toolbox for supporting open, inclusive and
transparent deliberations about public policy• Decision support systems, etc.• See also http://comma2014.arg.dundee.ac.uk/demoprogram.
TU Dresden, 14th September 2015 Abstract Argumentation slide 22 of 115
Outline
1 Argumentation in History
2 Argumentation Nowadays
3 IntroductionArgumentation ProcessForming Arguments
4 Abstract ArgumentationSyntaxSemanticsProperties of Semantics
5 Complexity of Abstract Argumentation
6 Argumentation Systems
7 Exercises
TU Dresden, 14th September 2015 Abstract Argumentation slide 23 of 115
The Overall Process
Steps• Starting point:
knowledge-base
• Form arguments
• Identify conflicts
• Abstract frominternal structure
• Resolve conflicts
• Draw conclusions
Example
TU Dresden, 14th September 2015 Abstract Argumentation slide 24 of 115
The Overall Process
Steps• Starting point:
knowledge-base
• Form arguments
• Identify conflicts
• Abstract frominternal structure
• Resolve conflicts
• Draw conclusions
Example∆ = {s, r, w, s→ ¬r, r→ ¬w, w→ ¬s}
TU Dresden, 14th September 2015 Abstract Argumentation slide 25 of 115
The Overall Process
Steps• Starting point:
knowledge-base
• Form arguments
• Identify conflicts
• Abstract frominternal structure
• Resolve conflicts
• Draw conclusions
Example∆ = {s, r, w, s→ ¬r, r→ ¬w, w→ ¬s}
〈{s, s→¬r},¬r〉 〈{r, r→¬w},¬w〉
〈{w, w→¬s},¬s〉
TU Dresden, 14th September 2015 Abstract Argumentation slide 26 of 115
The Overall Process
Steps• Starting point:
knowledge-base
• Form arguments
• Identify conflicts
• Abstract frominternal structure
• Resolve conflicts
• Draw conclusions
Example∆ = {s, r, w, s→ ¬r, r→ ¬w, w→ ¬s}
〈{s, s→¬r},¬r〉 〈{r, r→¬w},¬w〉
〈{w, w→¬s},¬s〉
TU Dresden, 14th September 2015 Abstract Argumentation slide 27 of 115
The Overall Process
Steps• Starting point:
knowledge-base
• Form arguments
• Identify conflicts
• Abstract frominternal structure
• Resolve conflicts
• Draw conclusions
Example∆ = {s, r, w, s→ ¬r, r→ ¬w, w→ ¬s}
F∆ :
α β
γ
TU Dresden, 14th September 2015 Abstract Argumentation slide 28 of 115
The Overall Process
Steps• Starting point:
knowledge-base
• Form arguments
• Identify conflicts
• Abstract frominternal structure
• Resolve conflicts
• Draw conclusions
Example∆ = {s, r, w, s→ ¬r, r→ ¬w, w→ ¬s}
F∆ :
α β
γ
pref (F∆) ={∅}
stage(F∆) ={{α}, {β}, {γ}
}
TU Dresden, 14th September 2015 Abstract Argumentation slide 29 of 115
The Overall Process
Steps• Starting point:
knowledge-base
• Form arguments
• Identify conflicts
• Abstract frominternal structure
• Resolve conflicts
• Draw conclusions
Example∆ = {s, r, w, s→ ¬r, r→ ¬w, w→ ¬s}
〈{s, s→¬r},¬r〉 〈{r, r→¬w},¬w〉
〈{w, w→¬s},¬s〉
Cnpref (F∆) = Cn(>)Cnstage(F∆) = Cn(¬r ∨ ¬w ∨ ¬s)
TU Dresden, 14th September 2015 Abstract Argumentation slide 30 of 115
The Overall Process (ctd.)
Some Remarks• Main idea dates back to Dung [1995]; has then been refined by several
authors (Prakken, Gordon, Caminada, etc.)• Separation between logical (forming arguments) and nonmonotonic
reasoning (“abstract argumentation frameworks”)• Abstraction allows to compare several KR formalisms on a conceptual
level (“calculus of conflict”)
Main Challenge• All Steps in the argumentation process are, in general, intractable.• This calls for:
• careful complexity analysis (identification of tractable fragments)• re-use of established tools for implementations (reduction method)
TU Dresden, 14th September 2015 Abstract Argumentation slide 31 of 115
The Overall Process (ctd.)
Some Remarks• Main idea dates back to Dung [1995]; has then been refined by several
authors (Prakken, Gordon, Caminada, etc.)• Separation between logical (forming arguments) and nonmonotonic
reasoning (“abstract argumentation frameworks”)• Abstraction allows to compare several KR formalisms on a conceptual
level (“calculus of conflict”)
Main Challenge• All Steps in the argumentation process are, in general, intractable.• This calls for:
• careful complexity analysis (identification of tractable fragments)• re-use of established tools for implementations (reduction method)
TU Dresden, 14th September 2015 Abstract Argumentation slide 32 of 115
Outline
1 Argumentation in History
2 Argumentation Nowadays
3 IntroductionArgumentation ProcessForming Arguments
4 Abstract ArgumentationSyntaxSemanticsProperties of Semantics
5 Complexity of Abstract Argumentation
6 Argumentation Systems
7 Exercises
TU Dresden, 14th September 2015 Abstract Argumentation slide 33 of 115
Approaches to Form Arguments
Classical Arguments [Besnard & Hunter, 2001]• Given is a KB (a set of propositions) ∆
• argument is a pair (Φ,α), such that Φ ⊆ ∆ is consistent, Φ |= α and forno Ψ ⊂ Φ, Ψ |= α
• conflicts between arguments (Φ,α) and (Φ′,α′) arise if Φ and α′ arecontradicting.
Example〈{s, s→¬r},¬r〉 〈{r, r→¬w},¬w〉
Other Approaches• Arguments are trees of statements• claims are obtained via strict and defeasible rules• different notions of conflict: rebuttal, undercut, etc.
TU Dresden, 14th September 2015 Abstract Argumentation slide 34 of 115
Approaches to Form Arguments
Classical Arguments [Besnard & Hunter, 2001]• Given is a KB (a set of propositions) ∆
• argument is a pair (Φ,α), such that Φ ⊆ ∆ is consistent, Φ |= α and forno Ψ ⊂ Φ, Ψ |= α
• conflicts between arguments (Φ,α) and (Φ′,α′) arise if Φ and α′ arecontradicting.
Example〈{s, s→¬r},¬r〉 〈{r, r→¬w},¬w〉
Other Approaches• Arguments are trees of statements• claims are obtained via strict and defeasible rules• different notions of conflict: rebuttal, undercut, etc.
TU Dresden, 14th September 2015 Abstract Argumentation slide 35 of 115
Approaches to Form Arguments
Classical Arguments [Besnard & Hunter, 2001]• Given is a KB (a set of propositions) ∆
• argument is a pair (Φ,α), such that Φ ⊆ ∆ is consistent, Φ |= α and forno Ψ ⊂ Φ, Ψ |= α
• conflicts between arguments (Φ,α) and (Φ′,α′) arise if Φ and α′ arecontradicting.
Example〈{s, s→¬r},¬r〉 〈{r, r→¬w},¬w〉
Other Approaches• Arguments are trees of statements• claims are obtained via strict and defeasible rules• different notions of conflict: rebuttal, undercut, etc.
TU Dresden, 14th September 2015 Abstract Argumentation slide 36 of 115
Outline
1 Argumentation in History
2 Argumentation Nowadays
3 Introduction
4 Abstract Argumentation
5 Complexity of Abstract Argumentation
6 Argumentation Systems
7 Exercises
TU Dresden, 14th September 2015 Abstract Argumentation slide 37 of 115
Dung’s Abstract Argumentation Frameworks
Example
α β
γ
Main Properties• Abstract from the concrete content of arguments but only consider the
relation between them• Semantics select subsets of arguments respecting certain criteria• Simple, yet powerful, formalism• Most active research area in the field of argumentation.
• “plethora of semantics”
TU Dresden, 14th September 2015 Abstract Argumentation slide 38 of 115
Dung’s Abstract Argumentation Frameworks
Example
α β
γ
Main Properties• Abstract from the concrete content of arguments but only consider the
relation between them• Semantics select subsets of arguments respecting certain criteria• Simple, yet powerful, formalism• Most active research area in the field of argumentation.
• “plethora of semantics”
TU Dresden, 14th September 2015 Abstract Argumentation slide 39 of 115
Outline
1 Argumentation in History
2 Argumentation Nowadays
3 IntroductionArgumentation ProcessForming Arguments
4 Abstract ArgumentationSyntaxSemanticsProperties of Semantics
5 Complexity of Abstract Argumentation
6 Argumentation Systems
7 Exercises
TU Dresden, 14th September 2015 Abstract Argumentation slide 40 of 115
Dung’s Abstract Argumentation Frameworks
DefinitionAn argumentation framework (AF) is a pair (A, R) where• A is a set of arguments• R ⊆ A× A is a relation representing the conflicts (“attacks”)
ExampleF = ( {a, b, c, d, e} , {(a, b), (c, b), (c, d), (d, c), (d, e), (e, e)} )
b c d ea
TU Dresden, 14th September 2015 Abstract Argumentation slide 41 of 115
Dung’s Abstract Argumentation Frameworks
DefinitionAn argumentation framework (AF) is a pair (A, R) where• A is a set of arguments• R ⊆ A× A is a relation representing the conflicts (“attacks”)
ExampleF = ( {a, b, c, d, e} , {(a, b), (c, b), (c, d), (d, c), (d, e), (e, e)} )
b c d ea
TU Dresden, 14th September 2015 Abstract Argumentation slide 42 of 115
Outline
1 Argumentation in History
2 Argumentation Nowadays
3 IntroductionArgumentation ProcessForming Arguments
4 Abstract ArgumentationSyntaxSemanticsProperties of Semantics
5 Complexity of Abstract Argumentation
6 Argumentation Systems
7 Exercises
TU Dresden, 14th September 2015 Abstract Argumentation slide 43 of 115
Basic Properties
Conflict-Free SetsGiven an AF F = (A, R).A set S ⊆ A is conflict-free in F, if, for each a, b ∈ S, (a, b) /∈ R.
Example
b c d ea
cf (F) ={{a, c},
TU Dresden, 14th September 2015 Abstract Argumentation slide 44 of 115
Basic Properties
Conflict-Free SetsGiven an AF F = (A, R).A set S ⊆ A is conflict-free in F, if, for each a, b ∈ S, (a, b) /∈ R.
Example
b c d ea
cf (F) ={{a, c},
TU Dresden, 14th September 2015 Abstract Argumentation slide 45 of 115
Basic Properties
Conflict-Free SetsGiven an AF F = (A, R).A set S ⊆ A is conflict-free in F, if, for each a, b ∈ S, (a, b) /∈ R.
Example
b c d ea
cf (F) ={{a, c}, {a, d},
TU Dresden, 14th September 2015 Abstract Argumentation slide 46 of 115
Basic Properties
Conflict-Free SetsGiven an AF F = (A, R).A set S ⊆ A is conflict-free in F, if, for each a, b ∈ S, (a, b) /∈ R.
Example
b c d ea
cf (F) ={{a, c}, {a, d}, {b, d},
TU Dresden, 14th September 2015 Abstract Argumentation slide 47 of 115
Basic Properties
Conflict-Free SetsGiven an AF F = (A, R).A set S ⊆ A is conflict-free in F, if, for each a, b ∈ S, (a, b) /∈ R.
Example
b c d ea
cf (F) ={{a, c}, {a, d}, {b, d}, {a}, {b}, {c}, {d}, ∅
}
TU Dresden, 14th September 2015 Abstract Argumentation slide 48 of 115
Basic Properties (ctd.)
Admissible Sets [Dung, 1995]Given an AF F = (A, R). A set S ⊆ A is admissible in F, if• S is conflict-free in F
• each a ∈ S is defended by S in F• a ∈ A is defended by S in F, if for each b ∈ A with (b, a) ∈ R, there
exists a c ∈ S, such that (c, b) ∈ R.
Example
b c d ea
adm(F) ={{a, c},
TU Dresden, 14th September 2015 Abstract Argumentation slide 49 of 115
Basic Properties (ctd.)
Admissible Sets [Dung, 1995]Given an AF F = (A, R). A set S ⊆ A is admissible in F, if• S is conflict-free in F
• each a ∈ S is defended by S in F• a ∈ A is defended by S in F, if for each b ∈ A with (b, a) ∈ R, there
exists a c ∈ S, such that (c, b) ∈ R.
Example
b c d ea
adm(F) ={{a, c},
TU Dresden, 14th September 2015 Abstract Argumentation slide 50 of 115
Basic Properties (ctd.)
Admissible Sets [Dung, 1995]Given an AF F = (A, R). A set S ⊆ A is admissible in F, if• S is conflict-free in F
• each a ∈ S is defended by S in F• a ∈ A is defended by S in F, if for each b ∈ A with (b, a) ∈ R, there
exists a c ∈ S, such that (c, b) ∈ R.
Example
b c d ea
adm(F) ={{a, c}, {a, d},
TU Dresden, 14th September 2015 Abstract Argumentation slide 51 of 115
Basic Properties (ctd.)
Admissible Sets [Dung, 1995]Given an AF F = (A, R). A set S ⊆ A is admissible in F, if• S is conflict-free in F
• each a ∈ S is defended by S in F• a ∈ A is defended by S in F, if for each b ∈ A with (b, a) ∈ R, there
exists a c ∈ S, such that (c, b) ∈ R.
Example
b c d ea
adm(F) ={{a, c}, {a, d}, {b, d},
TU Dresden, 14th September 2015 Abstract Argumentation slide 52 of 115
Basic Properties (ctd.)
Admissible Sets [Dung, 1995]Given an AF F = (A, R). A set S ⊆ A is admissible in F, if• S is conflict-free in F
• each a ∈ S is defended by S in F• a ∈ A is defended by S in F, if for each b ∈ A with (b, a) ∈ R, there
exists a c ∈ S, such that (c, b) ∈ R.
Example
b c d ea
adm(F) ={{a, c}, {a, d}, {b, d}, {a}, {b}, {c}, {d}, ∅
}
TU Dresden, 14th September 2015 Abstract Argumentation slide 53 of 115
Basic Properties (ctd.)
Dung’s Fundamental LemmaLet S be admissible in an AF F and a, a′ arguments in F defended by S in F.Then,
1 S′ = S ∪ {a} is admissible in F
2 a′ is defended by S′ in F
TU Dresden, 14th September 2015 Abstract Argumentation slide 54 of 115
Semantics
Naive ExtensionsGiven an AF F = (A, R). A set S ⊆ A is a naive extension of F, if• S is conflict-free in F
• for each T ⊆ A conflict-free in F, S 6⊂ T
Example
b c d ea
naive(F) ={{a, c},
TU Dresden, 14th September 2015 Abstract Argumentation slide 55 of 115
Semantics
Naive ExtensionsGiven an AF F = (A, R). A set S ⊆ A is a naive extension of F, if• S is conflict-free in F
• for each T ⊆ A conflict-free in F, S 6⊂ T
Example
b c d ea
naive(F) ={{a, c},
TU Dresden, 14th September 2015 Abstract Argumentation slide 56 of 115
Semantics
Naive ExtensionsGiven an AF F = (A, R). A set S ⊆ A is a naive extension of F, if• S is conflict-free in F
• for each T ⊆ A conflict-free in F, S 6⊂ T
Example
b c d ea
naive(F) ={{a, c}, {a, d},
TU Dresden, 14th September 2015 Abstract Argumentation slide 57 of 115
Semantics
Naive ExtensionsGiven an AF F = (A, R). A set S ⊆ A is a naive extension of F, if• S is conflict-free in F
• for each T ⊆ A conflict-free in F, S 6⊂ T
Example
b c d ea
naive(F) ={{a, c}, {a, d}, {b, d},
TU Dresden, 14th September 2015 Abstract Argumentation slide 58 of 115
Semantics
Naive ExtensionsGiven an AF F = (A, R). A set S ⊆ A is a naive extension of F, if• S is conflict-free in F
• for each T ⊆ A conflict-free in F, S 6⊂ T
Example
b c d ea
naive(F) ={{a, c}, {a, d}, {b, d}, {a}, {b}, {c}, {d}, ∅
}
TU Dresden, 14th September 2015 Abstract Argumentation slide 59 of 115
Semantics (ctd.)
Grounded Extension [Dung, 1995]Given an AF F = (A, R). The unique grounded extension of F is defined as theoutcome S of the following “algorithm”:
1 put each argument a ∈ A which is not attacked in F into S; if no suchargument exists, return S;
2 remove from F all (new) arguments in S and all arguments attacked bythem (together with all adjacent attacks); and continue with Step 1.
Example
b c d ea
ground(F) ={{a}}
TU Dresden, 14th September 2015 Abstract Argumentation slide 60 of 115
Semantics (ctd.)
Grounded Extension [Dung, 1995]Given an AF F = (A, R). The unique grounded extension of F is defined as theoutcome S of the following “algorithm”:
1 put each argument a ∈ A which is not attacked in F into S; if no suchargument exists, return S;
2 remove from F all (new) arguments in S and all arguments attacked bythem (together with all adjacent attacks); and continue with Step 1.
Example
b c d ea
ground(F) ={{a}}
TU Dresden, 14th September 2015 Abstract Argumentation slide 61 of 115
Semantics (ctd.)
Complete Extension [Dung, 1995]Given an AF (A, R). A set S ⊆ A is complete in F, if• S is admissible in F
• each a ∈ A defended by S in F is contained in S• Recall: a ∈ A is defended by S in F, if for each b ∈ A with (b, a) ∈ R,
there exists a c ∈ S, such that (c, b) ∈ R.
Example
b c d ea
comp(F) ={{a, c},
TU Dresden, 14th September 2015 Abstract Argumentation slide 62 of 115
Semantics (ctd.)
Complete Extension [Dung, 1995]Given an AF (A, R). A set S ⊆ A is complete in F, if• S is admissible in F
• each a ∈ A defended by S in F is contained in S• Recall: a ∈ A is defended by S in F, if for each b ∈ A with (b, a) ∈ R,
there exists a c ∈ S, such that (c, b) ∈ R.
Example
b c d ea
comp(F) ={{a, c},
TU Dresden, 14th September 2015 Abstract Argumentation slide 63 of 115
Semantics (ctd.)
Complete Extension [Dung, 1995]Given an AF (A, R). A set S ⊆ A is complete in F, if• S is admissible in F
• each a ∈ A defended by S in F is contained in S• Recall: a ∈ A is defended by S in F, if for each b ∈ A with (b, a) ∈ R,
there exists a c ∈ S, such that (c, b) ∈ R.
Example
b c d ea
comp(F) ={{a, c}, {a, d},
TU Dresden, 14th September 2015 Abstract Argumentation slide 64 of 115
Semantics (ctd.)
Complete Extension [Dung, 1995]Given an AF (A, R). A set S ⊆ A is complete in F, if• S is admissible in F
• each a ∈ A defended by S in F is contained in S• Recall: a ∈ A is defended by S in F, if for each b ∈ A with (b, a) ∈ R,
there exists a c ∈ S, such that (c, b) ∈ R.
Example
b c d ea
comp(F) ={{a, c}, {a, d}, {a},
TU Dresden, 14th September 2015 Abstract Argumentation slide 65 of 115
Semantics (ctd.)
Complete Extension [Dung, 1995]Given an AF (A, R). A set S ⊆ A is complete in F, if• S is admissible in F
• each a ∈ A defended by S in F is contained in S• Recall: a ∈ A is defended by S in F, if for each b ∈ A with (b, a) ∈ R,
there exists a c ∈ S, such that (c, b) ∈ R.
Example
b c d ea
comp(F) ={{a, c}, {a, d}, {a}, {c}, {d}, ∅
}
TU Dresden, 14th September 2015 Abstract Argumentation slide 66 of 115
Semantics (ctd.)
Properties of the Grounded ExtensionFor any AF F, the grounded extension of F is the subset-minimal completeextension of F.
RemarkSince there exists exactly one grounded extension for each AF F, we often writeground(F) = S instead of ground(F) = {S}.
TU Dresden, 14th September 2015 Abstract Argumentation slide 67 of 115
Semantics (ctd.)
Properties of the Grounded ExtensionFor any AF F, the grounded extension of F is the subset-minimal completeextension of F.
RemarkSince there exists exactly one grounded extension for each AF F, we often writeground(F) = S instead of ground(F) = {S}.
TU Dresden, 14th September 2015 Abstract Argumentation slide 68 of 115
Semantics (ctd.)
Preferred Extensions [Dung, 1995]Given an AF F = (A, R). A set S ⊆ A is a preferred extension of F, if• S is admissible in F
• for each T ⊆ A admissible in F, S 6⊂ T
Example
b c d ea
pref (F) ={{a, c}, {a, d}, {a}, {c}, {d}, ∅
}
TU Dresden, 14th September 2015 Abstract Argumentation slide 69 of 115
Semantics (ctd.)
Preferred Extensions [Dung, 1995]Given an AF F = (A, R). A set S ⊆ A is a preferred extension of F, if• S is admissible in F
• for each T ⊆ A admissible in F, S 6⊂ T
Example
b c d ea
pref (F) ={{a, c}, {a, d}, {a}, {c}, {d}, ∅
}
TU Dresden, 14th September 2015 Abstract Argumentation slide 70 of 115
Semantics (ctd.)
Stable Extensions [Dung, 1995]Given an AF F = (A, R). A set S ⊆ A is a stable extension of F, if• S is conflict-free in F
• for each a ∈ A \ S, there exists a b ∈ S, such that (b, a) ∈ R
Example
b c d ea
stable(F) ={{a, c}
TU Dresden, 14th September 2015 Abstract Argumentation slide 71 of 115
Semantics (ctd.)
Stable Extensions [Dung, 1995]Given an AF F = (A, R). A set S ⊆ A is a stable extension of F, if• S is conflict-free in F
• for each a ∈ A \ S, there exists a b ∈ S, such that (b, a) ∈ R
Example
b c d ea
stable(F) ={{a, c}
TU Dresden, 14th September 2015 Abstract Argumentation slide 72 of 115
Semantics (ctd.)
Stable Extensions [Dung, 1995]Given an AF F = (A, R). A set S ⊆ A is a stable extension of F, if• S is conflict-free in F
• for each a ∈ A \ S, there exists a b ∈ S, such that (b, a) ∈ R
Example
b c d ea
stable(F) ={{a, c}, {a, d},
TU Dresden, 14th September 2015 Abstract Argumentation slide 73 of 115
Semantics (ctd.)
Stable Extensions [Dung, 1995]Given an AF F = (A, R). A set S ⊆ A is a stable extension of F, if• S is conflict-free in F
• for each a ∈ A \ S, there exists a b ∈ S, such that (b, a) ∈ R
Example
b c d ea
stable(F) ={{a, c}, {a, d}, {b, d},
TU Dresden, 14th September 2015 Abstract Argumentation slide 74 of 115
Semantics (ctd.)
Stable Extensions [Dung, 1995]Given an AF F = (A, R). A set S ⊆ A is a stable extension of F, if• S is conflict-free in F
• for each a ∈ A \ S, there exists a b ∈ S, such that (b, a) ∈ R
Example
b c d ea
stable(F) ={{a, c}, {a, d}, {b, d}, {a}, {b}, {c}, {d}, ∅,
}
TU Dresden, 14th September 2015 Abstract Argumentation slide 75 of 115
Semantics (ctd.)
Some RelationsFor any AF F the following relations hold:
1 Each stable extension of F is admissible in F
2 Each stable extension of F is also a preferred one
3 Each preferred extension of F is also a complete one
TU Dresden, 14th September 2015 Abstract Argumentation slide 76 of 115
Semantics (ctd.)
Semi-Stable Extensions [Caminada, 2006]Given an AF F = (A, R). A set S ⊆ A is a semi-stable extension of F, if• S is admissible in F
• for each T ⊆ A admissible in F, S+ 6⊂ T+
• for S ⊆ A, define S+ = S ∪ {a | ∃b ∈ S with (b, a) ∈ R}
Example
b c d ea
semi(F) ={{a, c}, {a, d}, {a}, {c}, {d}, ∅
}
TU Dresden, 14th September 2015 Abstract Argumentation slide 77 of 115
Semantics (ctd.)
Semi-Stable Extensions [Caminada, 2006]Given an AF F = (A, R). A set S ⊆ A is a semi-stable extension of F, if• S is admissible in F
• for each T ⊆ A admissible in F, S+ 6⊂ T+
• for S ⊆ A, define S+ = S ∪ {a | ∃b ∈ S with (b, a) ∈ R}
Example
b c d ea
semi(F) ={{a, c}, {a, d}, {a}, {c}, {d}, ∅
}
TU Dresden, 14th September 2015 Abstract Argumentation slide 78 of 115
Semantics (ctd.)
Stage Extensions [Verheij, 1996]Given an AF F = (A, R). A set S ⊆ A is a stage extension of F, if• S is conflict-free in F
• for each T ⊆ A conflict-free in F, S+ 6⊂ T+
• recall S+ = S ∪ {a | ∃b ∈ S with (b, a) ∈ R}
Ideal Extension [Dung, Mancarella & Toni 2007]Given an AF F = (A, R). A set S ⊆ A is an ideal extension of F, if• S is admissible in F and contained in each preferred extension of F
• there is no T ⊃ S admissible in F and contained in each of pref (F)
Eager Extension [Caminada, 2007]Given an AF F = (A, R). A set S ⊆ A is an eager extension of F, if• S is admissible in F and contained in each semi-stable extension of F
• there is no T ⊃ S admissible in F and contained in each of semi(F)
TU Dresden, 14th September 2015 Abstract Argumentation slide 79 of 115
Semantics (ctd.)
Stage Extensions [Verheij, 1996]Given an AF F = (A, R). A set S ⊆ A is a stage extension of F, if• S is conflict-free in F
• for each T ⊆ A conflict-free in F, S+ 6⊂ T+
• recall S+ = S ∪ {a | ∃b ∈ S with (b, a) ∈ R}
Ideal Extension [Dung, Mancarella & Toni 2007]Given an AF F = (A, R). A set S ⊆ A is an ideal extension of F, if• S is admissible in F and contained in each preferred extension of F
• there is no T ⊃ S admissible in F and contained in each of pref (F)
Eager Extension [Caminada, 2007]Given an AF F = (A, R). A set S ⊆ A is an eager extension of F, if• S is admissible in F and contained in each semi-stable extension of F
• there is no T ⊃ S admissible in F and contained in each of semi(F)
TU Dresden, 14th September 2015 Abstract Argumentation slide 80 of 115
Semantics (ctd.)
Stage Extensions [Verheij, 1996]Given an AF F = (A, R). A set S ⊆ A is a stage extension of F, if• S is conflict-free in F
• for each T ⊆ A conflict-free in F, S+ 6⊂ T+
• recall S+ = S ∪ {a | ∃b ∈ S with (b, a) ∈ R}
Ideal Extension [Dung, Mancarella & Toni 2007]Given an AF F = (A, R). A set S ⊆ A is an ideal extension of F, if• S is admissible in F and contained in each preferred extension of F
• there is no T ⊃ S admissible in F and contained in each of pref (F)
Eager Extension [Caminada, 2007]Given an AF F = (A, R). A set S ⊆ A is an eager extension of F, if• S is admissible in F and contained in each semi-stable extension of F
• there is no T ⊃ S admissible in F and contained in each of semi(F)
TU Dresden, 14th September 2015 Abstract Argumentation slide 81 of 115
Semantics (ctd.)
Properties of Ideal ExtensionsFor any AF F the following observations hold:
1 there exists exactly one ideal extension of F
2 the ideal extension of F is also a complete one
The same results hold for the eager extension and similar variants [Dvorák etal., 2011].
TU Dresden, 14th September 2015 Abstract Argumentation slide 82 of 115
Semantics (ctd.)
Resolution-based grounded Extensions[Baroni,Giacomin 2008]A resolution β of an AF F = (A, R) contains exactly one of the attacks (a, b),(b, a) for each pair a, b ∈ A with {(a, b), (b, a)} ⊆ R.
A set S ⊆ A is a resolution-based grounded extension of F, if• there exists a resolution β such that ground((A, R \ β)) = S
• and there is no resolution β′ such that ground((A, R \ β′)) ⊂ S
Example
b c d ea
ground∗(F) ={{a, c},
TU Dresden, 14th September 2015 Abstract Argumentation slide 83 of 115
Semantics (ctd.)
Resolution-based grounded Extensions[Baroni,Giacomin 2008]A resolution β of an AF F = (A, R) contains exactly one of the attacks (a, b),(b, a) for each pair a, b ∈ A with {(a, b), (b, a)} ⊆ R.
A set S ⊆ A is a resolution-based grounded extension of F, if• there exists a resolution β such that ground((A, R \ β)) = S
• and there is no resolution β′ such that ground((A, R \ β′)) ⊂ S
Example
b c d ea
ground∗(F) ={{a, c},
TU Dresden, 14th September 2015 Abstract Argumentation slide 84 of 115
Semantics (ctd.)
Resolution-based grounded Extensions[Baroni,Giacomin 2008]A resolution β of an AF F = (A, R) contains exactly one of the attacks (a, b),(b, a) for each pair a, b ∈ A with {(a, b), (b, a)} ⊆ R.
A set S ⊆ A is a resolution-based grounded extension of F, if• there exists a resolution β such that ground((A, R \ β)) = S
• and there is no resolution β′ such that ground((A, R \ β′)) ⊂ S
Example
b c d ea
ground∗(F) ={{a, c}, {a, d}}
TU Dresden, 14th September 2015 Abstract Argumentation slide 85 of 115
cf2 Semantics [Baroni, Giacomin & Guida2005]
Definition (Separation)An AF F = (A, R) is called separated if for each (a, b) ∈ R, there exists a pathfrom b to a. We define [[F]] =
⋃C∈SCCs(F) F|C and call [[F]] the separation of F.
Example
TU Dresden, 14th September 2015 Abstract Argumentation slide 86 of 115
cf2 Semantics [Baroni, Giacomin & Guida2005]
Definition (Separation)An AF F = (A, R) is called separated if for each (a, b) ∈ R, there exists a pathfrom b to a. We define [[F]] =
⋃C∈SCCs(F) F|C and call [[F]] the separation of F.
Example
TU Dresden, 14th September 2015 Abstract Argumentation slide 87 of 115
cf2 Semantics (ctd.)
Definition (Reachability)Let F = (A, R) be an AF, B a set of arguments, and a, b ∈ A. We say that b isreachable in F from a modulo B, in symbols a⇒B
F b, if there exists a path from ato b in F|B.
Definition (∆F,S)For an AF F = (A, R), D ⊆ A, and a set S of arguments,
∆F,S(D) = {a ∈ A | ∃b ∈ S : b 6= a, (b, a) ∈ R, a 6⇒A\DF b}.
By ∆F,S, we denote the lfp of ∆F,S(∅).
TU Dresden, 14th September 2015 Abstract Argumentation slide 88 of 115
cf2 Semantics (ctd.)
Definition (Reachability)Let F = (A, R) be an AF, B a set of arguments, and a, b ∈ A. We say that b isreachable in F from a modulo B, in symbols a⇒B
F b, if there exists a path from ato b in F|B.
Definition (∆F,S)For an AF F = (A, R), D ⊆ A, and a set S of arguments,
∆F,S(D) = {a ∈ A | ∃b ∈ S : b 6= a, (b, a) ∈ R, a 6⇒A\DF b}.
By ∆F,S, we denote the lfp of ∆F,S(∅).
TU Dresden, 14th September 2015 Abstract Argumentation slide 89 of 115
cf2 Semantics (ctd.)
cf2 Extensions [G & Woltran 2010]Given an AF F = (A, R). A set S ⊆ A is a cf2-extension of F, if• S is conflict-free in F
• and S ∈ naive([[F −∆F,S]]).
ExampleS = {c, f , h}, S ∈ cf (F).
TU Dresden, 14th September 2015 Abstract Argumentation slide 90 of 115
cf2 Semantics (ctd.)
cf2 Extensions [G & Woltran 2010]Given an AF F = (A, R). A set S ⊆ A is a cf2-extension of F, if• S is conflict-free in F
• and S ∈ naive([[F −∆F,S]]).
ExampleS = {c, f , h}, S ∈ cf (F).
TU Dresden, 14th September 2015 Abstract Argumentation slide 91 of 115
cf2 Semantics (ctd.)
cf2 Extensions [G & Woltran 2010]Given an AF F = (A, R). A set S ⊆ A is a cf2-extension of F, if• S is conflict-free in F
• and S ∈ naive([[F −∆F,S]]).
ExampleS = {c, f , h}, S ∈ cf (F), ∆F,S(∅) = {d, e}.
TU Dresden, 14th September 2015 Abstract Argumentation slide 92 of 115
cf2 Semantics (ctd.)
cf2 Extensions [G & Woltran 2010]Given an AF F = (A, R). A set S ⊆ A is a cf2-extension of F, if• S is conflict-free in F
• and S ∈ naive([[F −∆F,S]]).
ExampleS = {c, f , h}, S ∈ cf (F), ∆F,S({d, e}) = {d, e}.
TU Dresden, 14th September 2015 Abstract Argumentation slide 93 of 115
cf2 Semantics (ctd.)
cf2 Extensions [G & Woltran 2010]Given an AF F = (A, R). A set S ⊆ A is a cf2-extension of F, if• S is conflict-free in F
• and S ∈ naive([[F −∆F,S]]).
ExampleS = {c, f , h}, S ∈ cf (F), ∆F,S = {d, e}, S ∈ naive([[F −∆F,S]]).
TU Dresden, 14th September 2015 Abstract Argumentation slide 94 of 115
Outline
1 Argumentation in History
2 Argumentation Nowadays
3 IntroductionArgumentation ProcessForming Arguments
4 Abstract ArgumentationSyntaxSemanticsProperties of Semantics
5 Complexity of Abstract Argumentation
6 Argumentation Systems
7 Exercises
TU Dresden, 14th September 2015 Abstract Argumentation slide 95 of 115
Relations between Semantics
conflict-free
naive
stage
stable
admissible
complete
preferred
semi-stable
ideal eager
grounded
res.b. grounded
cf2
Figure : An arrow from semantics σ to semantics τ encodesthat each σ-extension is also a τ -extension.
TU Dresden, 14th September 2015 Abstract Argumentation slide 96 of 115
Outline
1 Argumentation in History
2 Argumentation Nowadays
3 Introduction
4 Abstract Argumentation
5 Complexity of Abstract Argumentation
6 Argumentation Systems
7 Exercises
TU Dresden, 14th September 2015 Abstract Argumentation slide 97 of 115
Decision Problems on AFs
Credulous AcceptanceCredσ : Given AF F = (A, R) and a ∈ A; is a contained in at least oneσ-extension of F?
Skeptical AcceptanceSkeptσ : Given AF F = (A, R) and a ∈ A; is a contained in every σ-extension ofF?
If no extension exists then all arguments are skeptically accepted and noargument is credulously accepted1.
Hence we are also interested in the following problem:
Skeptically and Credulously acceptedSkept′σ : Given AF F = (A, R) and a ∈ A; is a contained in every and at least oneσ-extension of F?
1This is only relevant for stable semantics.
TU Dresden, 14th September 2015 Abstract Argumentation slide 98 of 115
Decision Problems on AFs
Credulous AcceptanceCredσ : Given AF F = (A, R) and a ∈ A; is a contained in at least oneσ-extension of F?
Skeptical AcceptanceSkeptσ : Given AF F = (A, R) and a ∈ A; is a contained in every σ-extension ofF?
If no extension exists then all arguments are skeptically accepted and noargument is credulously accepted1.
Hence we are also interested in the following problem:
Skeptically and Credulously acceptedSkept′σ : Given AF F = (A, R) and a ∈ A; is a contained in every and at least oneσ-extension of F?
1This is only relevant for stable semantics.
TU Dresden, 14th September 2015 Abstract Argumentation slide 99 of 115
Further Decision Problems
Verifying an extensionVerσ : Given AF F = (A, R) and S ⊆ A; is S a σ-extension of F?
Does there exist an extension?Existsσ : Given AF F = (A, R); Does there exist a σ-extension for F?
Does there exist a nonempty extensions?Exists¬∅σ : Does there exist a non-empty σ-extension for F?
TU Dresden, 14th September 2015 Abstract Argumentation slide 100 of 115
Further Decision Problems
Verifying an extensionVerσ : Given AF F = (A, R) and S ⊆ A; is S a σ-extension of F?
Does there exist an extension?Existsσ : Given AF F = (A, R); Does there exist a σ-extension for F?
Does there exist a nonempty extensions?Exists¬∅σ : Does there exist a non-empty σ-extension for F?
TU Dresden, 14th September 2015 Abstract Argumentation slide 101 of 115
Further Decision Problems
Verifying an extensionVerσ : Given AF F = (A, R) and S ⊆ A; is S a σ-extension of F?
Does there exist an extension?Existsσ : Given AF F = (A, R); Does there exist a σ-extension for F?
Does there exist a nonempty extensions?Exists¬∅σ : Does there exist a non-empty σ-extension for F?
TU Dresden, 14th September 2015 Abstract Argumentation slide 102 of 115
Complexity Results (Summary)
Complexity for decision problems in AFs.
σ Credσ Skeptσground P-c P-cnaive in L in Lstable NP-c co-NP-cadm NP-c trivialcomp NP-c P-cpref NP-c Πp
2-c
σ Credσ Skeptσsemi Σp
2-c Πp2-c
stage Σp2-c Πp
2-cideal in Θp
2 in Θp2
eager Πp2-c Πp
2-cground∗ NP-c co-NP-ccf2 NP-c co-NP-c
see [Baroni et al.2011, Coste-Marquis et al.2005, Dimopoulos and Torres1996, Dung1995, Dunne2008,
Dunne and Bench-Capon2002, Dunne and Bench-Capon2004, Dunne and Caminada2008, Dvorák et
al.2011, Dvorák and Woltran2010a, Dvorák and Woltran2010b]
TU Dresden, 14th September 2015 Abstract Argumentation slide 103 of 115
Intractable problems in AbstractArgumentation
Most problems in Abstract Argumentation are computationally intractable, i.e. atleast NP-hard. To show intractability for a specific reasoning problem we followthe schema given below:
Goal: Show that a reasoning problem is NP-hard.
Method: Reducing the NP-hard SAT problem to the reasoning problem.
• Consider an arbitrary CNF formula ϕ• Give a reduction that maps ϕ to an Argumentation Framework Fϕ
containing an argument ϕ.• Show that ϕ is satisfiable iff the argument ϕ is accepted.
TU Dresden, 14th September 2015 Abstract Argumentation slide 104 of 115
Canonical Reduction
DefinitionFor ϕ =
∧mi=1 li1 ∨ li2 ∨ li3 over atoms Z, build Fϕ = (Aϕ, Rϕ) with
Aϕ = Z ∪ Z ∪ {C1, . . . , Cm} ∪ {ϕ}Rϕ = {(z, z), (z, z) | z ∈ Z} ∪ {(Ci,ϕ) | i ∈ {1, . . . , m}} ∪
{(z, Ci) | i ∈ {1, . . . , m}, z ∈ {li1, li2, li3}} ∪{(z, Ci) | i ∈ {1, . . . , m},¬z ∈ {li1, li2, li3}}
ExampleLet Φ = (z1 ∨ z2 ∨ z3) ∧ (¬z2 ∨ ¬z3 ∨ ¬z4) ∧ (¬z1 ∨ z2 ∨ z4).
Φ
C1 C2 C3
z1 z1 z2 z2 z3 z3 z4 z4
TU Dresden, 14th September 2015 Abstract Argumentation slide 105 of 115
Canonical Reduction
DefinitionFor ϕ =
∧mi=1 li1 ∨ li2 ∨ li3 over atoms Z, build Fϕ = (Aϕ, Rϕ) with
Aϕ = Z ∪ Z ∪ {C1, . . . , Cm} ∪ {ϕ}Rϕ = {(z, z), (z, z) | z ∈ Z} ∪ {(Ci,ϕ) | i ∈ {1, . . . , m}} ∪
{(z, Ci) | i ∈ {1, . . . , m}, z ∈ {li1, li2, li3}} ∪{(z, Ci) | i ∈ {1, . . . , m},¬z ∈ {li1, li2, li3}}
ExampleLet Φ = (z1 ∨ z2 ∨ z3) ∧ (¬z2 ∨ ¬z3 ∨ ¬z4) ∧ (¬z1 ∨ z2 ∨ z4).
Φ
C1 C2 C3
z1 z1 z2 z2 z3 z3 z4 z4
TU Dresden, 14th September 2015 Abstract Argumentation slide 106 of 115
Canonical Reduction: CNF⇒ AF (ctd.)
TheoremThe following statements are equivalent:
1 ϕ is satisfiable
2 Fϕ has an admissible set containing ϕ
3 Fϕ has a complete extension containing ϕ
4 Fϕ has a preferred extension containing ϕ
5 Fϕ has a stable extension containing ϕ
TU Dresden, 14th September 2015 Abstract Argumentation slide 107 of 115
Complexity Results
Theorem1 Credstable is NP-complete
2 Credadm is NP-complete
3 Credcomp is NP-complete
4 Credpref is NP-complete
Proof.(1) The hardness is immediate by the last theorem.For the NP-membership we use the following guess & check algorithm:• Guess a set E ⊆ A
• verify that E is stable• for each a, b ∈ E check (a, b) 6∈ R• for each a ∈ A \ E check if there exists b ∈ E with (b, a) ∈ R
As this algorithm is in polynomial time we obtain NP-membership.
TU Dresden, 14th September 2015 Abstract Argumentation slide 108 of 115
Outline
1 Argumentation in History
2 Argumentation Nowadays
3 Introduction
4 Abstract Argumentation
5 Complexity of Abstract Argumentation
6 Argumentation Systems
7 Exercises
TU Dresden, 14th September 2015 Abstract Argumentation slide 109 of 115
Argumentation Systems
Tools with web-interface• ASPARTIX http://rull.dbai.tuwien.ac.at:8080/ASPARTIX/
• ConArg http://www.dmi.unipg.it/conarg/
Further Systems• See first International Competition on Computational Models of
Argumentation (ICCMA) http://argumentationcompetition.org
TU Dresden, 14th September 2015 Abstract Argumentation slide 110 of 115
Outline
1 Argumentation in History
2 Argumentation Nowadays
3 Introduction
4 Abstract Argumentation
5 Complexity of Abstract Argumentation
6 Argumentation Systems
7 Exercises
TU Dresden, 14th September 2015 Abstract Argumentation slide 111 of 115
Exercises1 Give an AF F such that stable(F) = ∅ and semi(F) 6= {∅}.
2 Show that the following statement holds for any AF F.If stable(F) 6= ∅ then stable(F) = semi(F) = stage(F).
3 Select three different semantics σ,σ′,σ′′ out of {pref , ideal, semi, eager,ground, stable} of your choice and provide three pairs of AFs such that
• σ(F1) = σ(G1) but σ′(F1) 6= σ′(G1)• σ′(F2) = σ′(G2) but σ′′(F2) 6= σ′′(G2)• σ′′(F3) = σ′′(G3) but σ(F3) 6= σ(G3)
TU Dresden, 14th September 2015 Abstract Argumentation slide 112 of 115
P. Baroni, P. E. Dunne, and M. Giacomin.On the resolution-based family of abstract argumentation semantics and its grounded instance.Artif. Intell., 175(3-4):791–813, 2011.
P. Baroni and M. Giacomin.Semantics of abstract argument systems.In Argumentation in Artificial Intelligence, pages 25–44. Springer, 2009.
P. Baroni, M. Giacomin, and G. Guida.SCC-Recursiveness: A General Schema for Argumentation Semantics.Artif. Intell., 168(1-2): 162–210. Springer, 2005.
T.J.M. Bench-Capon and P.E.Dunne.Argumentation in AI,AIJ 171:619-641, 2007
M. Caminada.Semi-stable semantics.In Proc. COMMA 2006, pages 121–130. IOS Press, 2006.
M. Caminada.Comparing two unique extension semantics for formal argumentation: ideal and eagerIn Proc. BNAIC 2007, pages 81–87, 2007.
S. Coste-Marquis, C. Devred, and P. Marquis.Symmetric argumentation frameworks.In Proc. ECSQARU 2005, pages 317–328. Springer, 2005.
Y. Dimopoulos and A. Torres.Graph theoretical structures in logic programs and default theories.Theor. Comput. Sci., 170(1-2):209–244, 1996.
P. M. Dung.
TU Dresden, 14th September 2015 Abstract Argumentation slide 113 of 115
On the acceptability of arguments and its fundamental role in nonmonotonic reasoning, logicprogramming and n-person games.Artif. Intell., 77(2):321–358, 1995.
P. M. Dung, P. Mancarella, and F. Toni.Computing ideal sceptical argumentation.Artif. Intell. 171(10-15):642–674, 2007.
P. E. Dunne.Computational properties of argument systems satisfying graph-theoretic constraints.Artif. Intell., 171(10-15):701–729, 2007.
P. E. Dunne.The computational complexity of ideal semantics I: Abstract argumentation frameworks.In Proc. COMMA’08, pages 147–158. IOS Press, 2008.
P. E. Dunne and T. J. M. Bench-Capon.Coherence in finite argument systems.Artif. Intell., 141(1/2):187–203, 2002.
P. E. Dunne and T. J. M. Bench-Capon.Complexity in value-based argument systems.In Proc. JELIA 2004, pages 360–371. Springer, 2004.
W. Dvorák, P. Dunne, and S. Woltran.Parametric properties of ideal semantics.In Proc. IJCAI 2011, pages 851–856, 2011.
W. Dvorák and S. WoltranOn the intertranslatability of argumentation semantics.J. Artif. Intell. Res. 41:445–475, 2011.
S. Gaggl and S. Woltran.
TU Dresden, 14th September 2015 Abstract Argumentation slide 114 of 115
cf2 semantics revisited.In Proc. COMMA 2010, pages 243–2540. IOS Press, 2010.
S. Gaggl and S. Woltran.Strong equivalence for argumentation semantics based on conflict-free sets.In Proc. ECSQARU 2011, pages 38–49. Springer, 2011.
S. Gaggl and S. Woltran.The cf2 argumentation semantics revisited.Journal of Logic and Computation, 23(5):925-949, 2013.
E. Oikarinen and S. Woltran.Characterizing strong equivalence for argumentation frameworks.Artif. Intell. 175(14-15): 1985–2009, 2011.
B. Verheij.Two approaches to dialectical argumentation: admissible sets and argumentation stages.In Proc. NAIC’96, pages 357–368, 1996.
TU Dresden, 14th September 2015 Abstract Argumentation slide 115 of 115