Oxford Journals
tools journals homepage advanced search contact help
Journal of Logic and Computation: Current Issue

OUP > Journals > Computing/Engineer. & Mathematics/Stats. > Journal of Logic and Computation

Journal of Logic and Computation

Computational Dialectics

Volume 13, Issue 3, June 2003: pp. 347-376

Original Article
Properties and Complexity of Some Formal Inter-agent Dialogues

Simon Parsons1, Michael Wooldridge2 and Leila Amgoud3

1Department of Computer and Information Science, Brooklyn College, City University of New York, 2900 Bedford Avenue, Brooklyn, NY 11210, USA. E-mail: parsons@sci.brooklyn.cuny.edu
2Department of Computer Science, University of Liverpool, Liverpool L69 7ZF, UK. E-mail: m.j.wooldridge@csc.liv.ac.uk
3IRIT, 118 route de Narbonne, 31062 Toulouse Cedex, France. E-mail: leila.amgoud@irit.fr

This paper studies argumentation-based dialogues between agents. It defines a set of locutions by which agents can trade arguments, a set of agent attitudes which relate what arguments an agent can build and what locutions it can make, and a set of protocols by which dialogues can be carried out. The paper then considers some properties of dialogues under the protocols, in particular termination, dialogue outcomes, and complexity, and shows how these relate to the agent attitudes.

Keywords: Argumentation, dialogue, complexity.

Table of Contents   Full-Text PDF (266 KB)

Oxford University Press
Published by Oxford University Press
Copyright ©Oxford University Press 2003
Print ISSN: 0955-792X  Online ISSN: 1465-363X.
Oxford University Press Privacy Policy and Legal Statement