Formal theories of knowledge in AI and robotics
New Generation Computing
Principles of artificial intelligence
Principles of artificial intelligence
The design and analysis of spatial data structures
The design and analysis of spatial data structures
METATEM: a framework for programming in temporal logic
REX workshop Proceedings on Stepwise refinement of distributed systems: models, formalisms, correctness
Artificial Intelligence
Implementing semantics of disjunctive logic programs using fringes and abstract properties
Proceedings of the second international workshop on Logic programming and non-monotonic reasoning
A situated view of representation and control
Artificial Intelligence - Special volume on computational research on interaction and agency, part 2
Formalizing the cooperative problem solving process
Readings in agents
Heterogeneous active agents, I: semantics
Artificial Intelligence
Heterogeneous Agent Systems
Computing Non-Ground Representations of Stable Models
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Using Generalized Annotated Programs to Solve Social Network Diffusion Optimization Problems
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
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.