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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Van Riemsdijk, M. B., & Meyer, J. J. C. (2006). A compositional semantics of plan revision in intelligent agents. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4019 LNCS, pp. 353–367). Springer Verlag. https://doi.org/10.1007/11784180_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
