Relating Protocols for Dynamic Dispute with Logics for Defeasible Argumentation (2000)
| Venue: | Synthese |
| Citations: | 50 - 9 self |
BibTeX
@ARTICLE{Prakken00relatingprotocols,
author = {Henry Prakken},
title = {Relating Protocols for Dynamic Dispute with Logics for Defeasible Argumentation},
journal = {Synthese},
year = {2000},
volume = {127},
pages = {2001}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. This article investigates to what extent protocols for dynamic disputes, i.e., disputes in which the information base can vary at dierent stages, can be justied in terms of logics for defeasible argumentation. First a general framework is formulated for dialectical proof theories for such logics. Then this framework is adapted to serve as a framework for protocols for dynamic disputes, after which soundness and fairness properties are formulated for such protocols relative to dialectical proof theories. It then turns out that certain types of protocols that are perfectly ne with a static information base, are not sound or fair in a dynamic setting. Finally, a natural dynamic protocol is dened for which soundness and fairness can be established. 1. Introduction This paper studies the exchange of arguments and counterarguments in dynamic disputes, i.e., in disputes where the available information can change during the dispute. The research is motivated by two recent developments ...
