First order heterogeneous agent computations
Bogdan Stroe, V. S. Subrahmanian · 2003
Eiter et. al. (1999) have developed a semantics for agents built on top of legacy code bases. In this paper, we study positive agents in their setting. Their semantics are given in terms of "ground" status atoms. In this paper, we argue that the requirement of being ground poses a huge computational overhead. We propose a non-ground semantics for heterogeneous agents in which the semantical structures proposed by Eiter et. al. can be succinctly represented. We use this representation to efficiently compute the nonground representations. We describe our algorithms as well as a prototype experimental implementation using which we validate the efficiency gains realized with our new implementation.