Credulous and Sceptical Argument Games for Preferred Semantics (2000)
| Venue: | in Proceedings of JELIA’2000, The 7th European Workshop on Logic for Artificial Intelligence |
| Citations: | 45 - 2 self |
BibTeX
@INPROCEEDINGS{Vreeswijk00credulousand,
author = {Gerard A. W. Vreeswijk and Henry Prakken},
title = {Credulous and Sceptical Argument Games for Preferred Semantics},
booktitle = {in Proceedings of JELIA’2000, The 7th European Workshop on Logic for Artificial Intelligence},
year = {2000},
pages = {224--238},
publisher = {Springer LNAI}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. This paper presents dialectical proof theories for Dung's preferred semantics of defeasible argumentation. The proof theories have the form of argument games for testing membership of some (credulous reasoning) or all preferred extensions (sceptical reasoning). The credulous proof theory is for the general case, while the sceptical version is for the case where preferred semantics coincides with stable semantics. The development of these argument games is especially motivated by applications of argumentation in automated negotiation, mediation of collective discussion and decision making, and intelligent tutoring. 1 Introduction An important approach to the study of nonmonotonic reasoning is that of logics for defeasible argumentation (for an overview see [25]). Within this approach, a unifying perspective is provided by the work of [9] and [4] (below called the `BDKT framework'). It takes as input a set of arguments ordered by a binary relation of `attack', and it produces...
