Meta-agent programs

There are numerous applications where an agent a needs to reason about the beliefs another agent, as well as about the actions that other agents may take. In [T. Either, V.S. Subrahmanian, G. Pick, Heterogeneous Active Agents, I: Semantics, Artificial Intelligence 108 (1-2) (1999) 179-255] the concept of an agent program is introduced, and a language within which the operating principles of an agent can be declaratively encoded on top of imperative data structures is defined. In this paper we first introduce certain belief data structures that an agent needs to maintain. Then we introduce the concept of a Meta Agent Program (map), that extends the framework of Refs. [T. Eiter, V.S. Subrahmanian, Heterogeneous Active Agents, II: Algorithms and Complexity, Artificial Intelligence 108 (1-2) (1999) 257-307; loc. cit.] so as to allow agents to perform metareasoning. We build a formal semantics for maps, and show how this semantics supports not just beliefs agent a may have about agent l's state, but also beliefs about agents l's beliefs about agent c's actions, beliefs about l's beliefs about agent c's state, and so on. Finally, we provide a transansation that takes any map as input and converts it into an agent program such that there is a one-one correspondence between the semantics of the map and the semantics of the resulting agent program. This correspondence allows an implementation of maps to be built on top of an implementation of agent programs.