An executable specification of a formal argumentation protocol

被引:16
作者
Artikis, Alexander [1 ]
Sergot, Marek
Pitt, Jeremy
机构
[1] NCSR Demokritos, Inst Informat & Telecommun, Athens 15310, Greece
[2] Univ London Imperial Coll Sci Technol & Med, Dept Comp, London SW7 2AZ, England
[3] Univ London Imperial Coll Sci Technol & Med, Dept Elect & Elect Engn, London SW7 2BT, England
基金
英国工程与自然科学研究理事会;
关键词
argumentation; disputation; protocol; norm; multi-agent system; specification; action language;
D O I
10.1016/j.artint.2007.04.008
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
We present a specification, in the action language C+, of Brewka's reconstruction of a theory of formal disputation originally proposed by Rescher. The focus is on the procedural aspects rather than the adequacy of this particular protocol for the conduct of debate and the resolution of disputes. The specification is structured in three separate levels, covering (i) the physical capabilities of the participant agents, (ii) the rules defining the protocol itself, specifying which actions are 'proper' and 'timely' according to the protocol and their effects on the protocol state, and (iii) the permissions, prohibitions, and obligations of the agents, and the sanctions and enforcement strategies that deal with non-compliance. Also included is a mechanism by which an agent may object to an action by another participant, and at. optional 'silence implies consent' principle. Although comparatively simple, Brewka's protocol is thus representative of a wide range of other more complex argumentation and dispute resolution procedures that have been proposed. Finally, we show how the 'Causal Calculator' implementation of C+ can be used to animate the specification and to investigate and verify properties of the protocol. (c) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码:776 / 804
页数:29
相关论文
共 67 条
[1]   Representing the Zoo World and the Traffic World in the language of the causal calculator [J].
Akman, V ;
Erdogan, ST ;
Lee, J ;
Lifschitz, V ;
Turner, H .
ARTIFICIAL INTELLIGENCE, 2004, 153 (1-2) :105-140
[2]  
AMGOUD L, 2000, P 4 INT C MULT SYST, P31
[3]  
ARTIKIS A, 2003, THESIS U LONDON
[4]  
ARTIKIS A, 2003, P 9 INT C ART INT LA, P1
[5]  
ARTIKIS A, 2006, 20065 SPEC NORM GOV
[6]  
BODENSTAFF L, 2006, P WORKSH NON MON REA
[7]   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
[8]   Dynamic argument systems: A formal model of argumentation processes based on situation calculus [J].
Brewka, G .
JOURNAL OF LOGIC AND COMPUTATION, 2001, 11 (02) :257-282
[9]  
BREWKA G, 1998, FESTSCHRIFT 60 ANN
[10]  
CAYROL C, 1995, P 14 INT JOINT C ART, P1443