Abstract
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 non-ground representations. We describe our algorithms as well as a prototype experimental implementation using which we validate the efficiency gains realized with our new implementation.
| Original language | English (US) |
|---|---|
| Pages | 217-224 |
| Number of pages | 8 |
| DOIs | |
| State | Published - 2003 |
| Externally published | Yes |
| Event | Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 03 - Melbourne, Vic., Australia Duration: Jul 14 2003 → Jul 18 2003 |
Conference
| Conference | Proceedings of the Second International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS 03 |
|---|---|
| Country/Territory | Australia |
| City | Melbourne, Vic. |
| Period | 7/14/03 → 7/18/03 |
Keywords
- Heterogeneous agents
- Non-ground representations
ASJC Scopus subject areas
- General Engineering