Credulous and sceptical argument games for preferred semantics

被引:75
作者
Vreeswijk, GAW [1 ]
Prakken, H [1 ]
机构
[1] Univ Utrecht, Inst Comp & Informat Sci, NL-3508 TC Utrecht, Netherlands
来源
LOGICS IN ARTIFICIAL INTELLIGENCE | 2000年 / 1919卷
关键词
D O I
10.1007/3-540-40006-0_17
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:239 / 253
页数:15
相关论文
共 29 条
[1]  
Aleven Vincent, 1997, P 6 INT C ARTIFICIAL, P170
[2]  
AMGOUD L, 2000, P 4 INT C MULT SYST
[3]  
BENCHCAPON TJM, 1998, LEGAL KNOWLEDGE BASE
[4]   An abstract, argumentation-theoretic approach to default reasoning [J].
Bondarenko, A ;
Dung, PM ;
Kowalski, RA ;
Toni, F .
ARTIFICIAL INTELLIGENCE, 1997, 93 (1-2) :63-101
[5]  
BREWKA G, 2000, IN PRESS J LOGIC COM
[6]  
BREWKA G, 1994, P 11 EUR C ART INT, P366
[7]  
Dimopoulos Y, 1999, IJCAI-99: PROCEEDINGS OF THE SIXTEENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOLS 1 & 2, P36
[8]   ON THE ACCEPTABILITY OF ARGUMENTS AND ITS FUNDAMENTAL ROLE IN NONMONOTONIC REASONING, LOGIC PROGRAMMING AND N-PERSON GAMES [J].
DUNG, PM .
ARTIFICIAL INTELLIGENCE, 1995, 77 (02) :321-357
[9]  
DUNG PM, 1994, LOGIC PROGRAMMING DI
[10]  
GORDON TF, 1993, THESIS TECHNISCHE HO