A computational model for conversation policies for agent communication

  • Authors:
  • Jamal Bentahar;Bernard Moulin;John-Jules Ch. Meyer;Brahim Chaib-draa

  • Affiliations:
  • Department of Computer Science and Software Engineering, Laval University, Canada;Department of Computer Science and Software Engineering, Laval University, Canada;Department of Computer Science, University Utrecht, The Netherlands;Department of Computer Science and Software Engineering, Laval University, Canada

  • Venue:
  • CLIMA'04 Proceedings of the 5th international conference on Computational Logic in Multi-Agent Systems
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we propose a formal specification of a persuasion protocol between autonomous agents using an approach based on social commitments and arguments. In order to be flexible, this protocol is defined as a combination of a set of conversation policies. These policies are formalized as a set of dialogue games. The protocol is specified using two types of dialogue games: entry dialogue game and chaining dialogue games. The protocol terminates when exit conditions are satisfied. Using a tableau method, we prove that this protocol always terminates. The paper addresses also the implementation issues of our protocol using logical programming and an agent-oriented platform.