Towards a Common Framework for Dialectical Proof Procedures in Abstract Argumentation

被引:35
作者
Thang, Phan Minh [1 ]
Dung, Phan Minh [1 ]
Hung, Nguyen Duy [1 ]
机构
[1] Asian Inst Technol, Dept Comp Sci, Klongluang 12120, Pathumthani, Thailand
关键词
Abstract argumentation; dialectical; proof procedure; dispute resolution; COMPUTING ARGUMENTATION; SEMANTICS; MODEL; ACCEPTABILITY; PERSUASION; COHERENCE;
D O I
10.1093/logcom/exp032
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We present a common framework for dialectical proof procedures for computing credulous, grounded, ideal and sceptical preferred semantics of abstract argumentation. The framework is based on the notions of dispute derivation and base derivation. Dispute derivation is a dialectical notion first introduced for computing credulous semantics in assumption-based argumentation, and adapted here for computing credulous semantics and grounded semantics. Base derivation is introduced for two purposes: (i) to characterize all preferred extensions containing a given argument, and (ii) to represent backtracking in the search for a dispute derivation. We prove the Soundness of the proof procedures for any argumentation frameworks and their completeness for general classes of finitary or finite-branching argumentation frameworks containing the class of finite argumentation frameworks as a subclass. We also discuss related results.
引用
收藏
页码:1071 / 1109
页数:39
相关论文
共 60 条
[1]   A reasoning model based on the production of acceptable arguments [J].
Amgoud, L ;
Cayrol, C .
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE, 2002, 34 (1-3) :197-215
[2]  
[Anonymous], 1997, J. Appl. Non-class. Log., DOI DOI 10.1080/11663081.1997.10510900
[3]  
[Anonymous], 2003, Proceedings of the 2nd International Joint Conference on Autonomous Agents and Multiagent Systems (AAMAS 2003)
[4]   Legal case-based reasoning as practical reasoning [J].
Atkinson, Katie ;
Bench-Capon, Trevor .
ARTIFICIAL INTELLIGENCE AND LAW, 2005, 13 (01) :93-131
[5]   SCC-recursiveness: a general schema for argumentation semantics [J].
Baroni, P ;
Giacomin, M ;
Guida, G .
ARTIFICIAL INTELLIGENCE, 2005, 168 (1-2) :162-210
[6]  
Baroni P, 2003, LECT NOTES ARTIF INT, V2711, P440
[7]  
Baroni P, 2008, FRONT ARTIF INTEL AP, V172, P37
[8]   On principle-based evaluation of extension-based argumentation semantics [J].
Baroni, Pietro ;
Giacomin, Massimiliano .
ARTIFICIAL INTELLIGENCE, 2007, 171 (10-15) :675-700
[9]   Persuasion and value in legal argument [J].
Bench-Capon, T ;
Atkinson, K ;
Chorley, A .
JOURNAL OF LOGIC AND COMPUTATION, 2005, 15 (06) :1075-1097
[10]   A model of legal reasoning with cases incorporating theories and values [J].
Bench-Capon, T ;
Sartor, G .
ARTIFICIAL INTELLIGENCE, 2003, 150 (1-2) :97-143