An executable specification of an argumentation protocol

Open multi-agent computational systems are composed of heterogeneous and possibly antagonistic software entities. Characteristic features are limited trust and unpredictable behaviour. Members of such systems may fail to, or even choose not to, conform to the norms governing their interactions. It has been argued that systems of this type should have a formal, declarative, verifiable, and meaningful semantics. We present a theoretical and computational framework being developed for the executable specification of such systems. We adopt an external perspective and view open computational systems as instances of normative systems. In this paper we demonstrate how the framework can be applied to specifying and executing an argumentation protocol based on Brewka's reconstruction of Rescher's theory of formal disputation. The specification is formalised in the action language C+ and executed using the 'Causal Calculator' (CCALC) implementation.

[1]  Marek Sergot,et al.  On the characterization of law and computer systems: the normative systems perspective , 1994 .

[2]  Enrico Giunchiglia,et al.  An Action Language Based on Causal Explanation: Preliminary Report , 1998, AAAI/IAAI.

[3]  Alexander Artikis,et al.  Animated specifications of computational societies , 2002, AAMAS '02.

[4]  Enrico Giunchiglia,et al.  Nonmonotonic causal theories , 2004, Artif. Intell..

[5]  Randall Davis,et al.  Distributed Problem Solving: The Contract Net Approach , 1978 .

[6]  Alex M. Andrew,et al.  Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems , 2002 .

[7]  Carl Hewitt,et al.  Open Information Systems Semantics for Distributed Artificial Intelligence , 1991, Artif. Intell..

[8]  Thomas Eiter,et al.  Prioritizing Default Logic , 2000, Intellectics and Computational Logic.

[9]  Raymond Reiter,et al.  Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems , 2001 .

[10]  Enrico Giunchiglia,et al.  Causal Laws and Multi-Valued Fluents , 2001 .

[11]  Gerhard Brewka,et al.  Dynamic Argument Systems: A Formal Model of Argumentation Processes Based on Situation Calculus , 2001, J. Log. Comput..

[12]  Marek J. Sergot,et al.  A Formal Characterisation of Institutionalised Power , 1996, Log. J. IGPL.

[13]  Moshe Tennenholtz,et al.  Artificial Social Systems , 1992, Lecture Notes in Computer Science.

[14]  Munindar P. Singh,et al.  Flexible protocol specification and execution: applying event calculus planning using commitments , 2002, AAMAS '02.

[15]  Nicholas Rescher,et al.  Dialectics: A Controversy-Oriented Approach to the Theory of Knowledge , 1977 .

[16]  Prakken,et al.  Formalizing Robert''s Rules of Order An Experiment in Automating Mediation of Group Decision Making , 2001 .

[17]  Marc Esteva,et al.  On the Formal Specifications of Electronic Institutions , 2001, AgentLink.

[18]  Alexander Artikis,et al.  Specifying Electronic Societies with the Causal Calculator , 2002, AOSE.

[19]  Marc Esteva,et al.  On the formal specification of electronic institutions , 2001 .