A compositional semantics of plan revision in intelligent agents

Authors:
M. Birna van Riemsdijk;John-Jules Ch. Meyer
Affiliations:
Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands;Department of Information and Computing Sciences, Utrecht University, Utrecht, The Netherlands
Venue:
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Year:
2006

Citing 10
Cited 3

Intention is choice with commitment

Artificial Intelligence
Agent-oriented programming

Artificial Intelligence
AgentSpeak(L): BDI agents speak out in a logical computable language

MAAMAW '96 Proceedings of the 7th European workshop on Modelling autonomous agents in a multi-agent world : agents breaking away: agents breaking away
ConGolog, a concurrent programming language based on the situation calculus

Artificial Intelligence
Agent-oriented software engineering: the state of the art

First international workshop, AOSE 2000 on Agent-oriented software engineering
Mathematical Theory of Program Correctness

Mathematical Theory of Program Correctness
Agent Programming in 3APL

Autonomous Agents and Multi-Agent Systems
Semantics of plan revision in intelligent agents

Theoretical Computer Science - Algebraic methodology and software technology
Dynamic Logic for Plan Revision in Agent Programming

Journal of Logic and Computation
Dynamic logic for plan revision in intelligent agents

CLIMA'04 Proceedings of the 5th international conference on Computational Logic in Multi-Agent Systems

Prototyping 3APL in the Maude term rewriting language

CLIMA VII'06 Proceedings of the 7th international conference on Computational logic in multi-agent systems
Dynamic logic for plan revision in intelligent agents

CLIMA'04 Proceedings of the 5th international conference on Computational Logic in Multi-Agent Systems
Programming cognitive agents

MATES'05 Proceedings of the Third German conference on Multiagent System Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper revolves around the so-called plan revision rules of the agent programming language 3APL. These rules can be viewed as a generalization of procedures. This generalization however results in the semantics of programs of the 3APL language no longer being compositional. This gives rise to problems when trying to define a proof system for the language. In this paper we define a restricted version of plan revision rules which extends procedures, but which does have a compositional semantics, as we will formally show.