Dynamic Logic for Plan Revision in Agent Programming


In this paper, we present a dynamic logic for a propositional version of the agent programming language 3APL. A 3APL agent has beliefs and a plan. The execution of a plan changes an agent’s beliefs. Plans can be revised during execution by means of plan revision rules. Due to these plan revision capabilities of 3APL agents, plans cannot be analyzed by structural induction as in for example standard propositional dynamic logic. We propose a dynamic logic that is tailored to handle the plan revision aspect of 3APL. The logic is one for plans that are restricted in a certain way. For this logic, we give a sound and complete axiomatization. Further, we discuss how this logic for restricted 3APL plans can be extended to a logic for non-restricted plans and we discuss some example proofs, using the logic. Finally, we consider the relation between proving properties of 3APL agents and proving properties of procedural programs.

DOI: 10.1093/logcom/exi084

Extracted Key Phrases

Cite this paper

@article{Riemsdijk2006DynamicLF, title={Dynamic Logic for Plan Revision in Agent Programming}, author={M. Birna van Riemsdijk and Frank S. de Boer and John-Jules Ch. Meyer}, journal={J. Log. Comput.}, year={2006}, volume={16}, pages={375-402} }