An Abstract Machine for Classes of Communicating Agents Based on Deduction

  • Authors:
  • Pierre E. Bonzon

  • Affiliations:
  • -

  • Venue:
  • ATAL '01 Revised Papers from the 8th International Workshop on Intelligent Agents VIII
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider the problem of defining executable runs for classes of communicating agents. We first define an abstract machine that generates runs for individual agents with non-deterministic plans. We then introduce agent classes whose communication primitives are based on deduction. While current communication models are overly expressive with respect to the core agent models that are used as background theory, communicating agents based on deduction achieve a balanced integration. Contrary to other more theoretical work, their operational semantics are given by an abstract machine that is defined purely in sequential terms. This machine readily offers straightforward opportunities for implementing and experimenting prototypes of collaborative agents.