Abstract
In abstract argumentation arguments are just points in a network of attacks: they do not hold premisses, conclusions or internal structure. So is there a meaningful way in which two arguments, belonging possibly to different attack graphs, can be said to be equivalent? The paper argues for a positive answer and, interfacing methods from modal logic, the theory of argument games and the equational approach to argumentation, puts forth and explores a formal theory of equivalence for abstract argumentation.
Original language | English |
---|---|
Title of host publication | Outstanding Contributions to Logic |
Publisher | Springer |
Pages | 677-701 |
Number of pages | 25 |
DOIs | |
State | Published - 2014 |
Publication series
Name | Outstanding Contributions to Logic |
---|---|
Volume | 5 |
ISSN (Print) | 2211-2758 |
ISSN (Electronic) | 2211-2766 |
Bibliographical note
Publisher Copyright:© 2014, Springer International Publishing Switzerland.
Keywords
- Abstract argumentation
- Argument games
- Bisimulation
- Equational approaches
- Modal logic