Table of Contents
The logic of defeasible argumentation
Argument attack and argument defeat
Overview
Pollock’s undercutters and rebutters
Example: an undercutter
Example: a rebutter
Pollock’s undercutters and rebutters
Two metaphors of argument defeat
Argument comparison
Argument attack
Argument comparison or argument attack?
Argument comparison or argument attack?
PPT Slide
The difference between attack and defeat
Dung: attack as a binary relation on abstract arguments
The attack relation as a graph
Admissible sets
Admissible sets
PPT Slide
Dung’s preferred and stable extensions
Admissible sets
PPT Slide
Mutual attack and multiple extensions
Odd-length attack loops
Basic properties of Dung’s extensions
Dung’s contribution
Defeat statuses and argumentation stages
Defeat statuses and argumentation stages
Argumentation stages
PPT Slide
Stage extensions
Argumentation stages
Mutual attack and multiple extensions
Odd-length attack loops
An attack relation without a stage extension
Basic properties of stage extensions
Admissible sets and argumentation stages
Admissible sets and argumentation stages
Counterattack and reinstatement
Mutual attack and multiple extensions
Odd-length attack loops
An attack relation without a stage extension
PPT Slide
Multiple stages, but a unique extension
Mutual attack skewly breaking an odd-length loop of attacks
Mutual attack skewly breaking a odd-length loop of attacks
PPT Slide
Relations between stage types
Computing defeat statuses
An example
Basic properties of the algorithm
PPT Slide
Individual and groupwise defeat
Self-defeat
Self-defeat
More than two defeat statuses
Derived defeat statuses
Are more than two defeat statuses necessary?
Typology
Summary
PPT Slide
PPT Slide
PPT Slide
|