Foundations of logic programming
Foundations of logic programming
Formal theories of knowledge in AI and robotics
New Generation Computing
Intelligent integration of information
SIGMOD '93 Proceedings of the 1993 ACM SIGMOD international conference on Management of data
ACM Transactions on Database Systems (TODS)
Query caching and optimization in distributed mediator systems
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Readings in agents
Heterogeneous active agents, I: semantics
Artificial Intelligence
Heterogeneous active agents, III: polynomially implementable agents
Artificial Intelligence
IEEE Transactions on Knowledge and Data Engineering
Scaling Access to Heterogeneous Data Sources with DISCO
IEEE Transactions on Knowledge and Data Engineering
Optimizing Queries Across Diverse Data Sources
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
An Abductive Proof Procedure for Reasoning About Actions in Modal Logic Programming
NMELP '96 Selected papers from the Non-Monotonic Extensions of Logic Programming
Foundations and Trends in Web Science
Hi-index | 0.00 |
There are numerous applications where a variety of human and software participants interactively pursue a given task (play a game, engage in a simulation, etc.). In this paper, we define a basic architecture for a distributed, interactive system (DIS for short). We then formally define a mathematical construct called a DIS abstraction that provides a theoretical basis for a software platform for building distributed interactive systems. Our framework provides a language for building multiagent applications where each agent has its own behaviors and where the behavior of the multiagent application as a whole is governed by one or more “master” agents. Agents in such a multiagent application may compete for resources, may attempt to take actions based on incorrect beliefs, may attempt to take actions that conflict with actions being concurrently attempted by other agents, and so on. Master agents mediate such conflicts. Our language for building agents (ordinary and master) depends critically on a notion called a “generalized constraint” that we define. All agents attempt to optimize an objective function while satisfying such generalized constraints that the agent is bound to preserve. We develop several algorithms to determine how an agent satisfies its generalized constraints in response to events in the multiagent application. We experimentally evaluate these algorithms in an attempt to understand their advantages and disadvantages.