Reliable Agent Computation: An Algebraic Approach

  • Authors:
  • David Kinny

  • Affiliations:
  • -

  • Venue:
  • PRIMA 2001 Proceedings of the 4th Pacific Rim International Workshop on Multi-Agents, Intelligent Agents: Specification, Modeling, and Applications
  • Year:
  • 2001

Quantified Score

Hi-index 0.00

Visualization

Abstract

Agent programming languages based on a sense-compute-act cycle and stored plan execution, such as PRS and dMARS, lack any formal semantics; this and the actual computational models which they employ can make it difficult or impossible to reason about agent behaviour. In this paperwe present the 驴 calculus, a novel algebraic language which generalizes and extends these languages and remedies several of their shortcomings. 驴 has a complete operational semantics covering all aspects of agent computation from intention step execution to the top-level control cycle, specified uniformly in process algebraic style, and has certain desirable safety, guarantee and compositionality properties which facilitate reasoning about agent program behaviour.