Speculative computation with multi-agent belief revision
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
From logic programming towards multi-agent systems
Annals of Mathematics and Artificial Intelligence
Speculative Computation by Abduction under Incomplete Communication Environments
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Programming constraint services: high-level programming of standard and new constraint services
Programming constraint services: high-level programming of standard and new constraint services
Speculative abductive reasoning for hierarchical agent systems
CLIMA'10 Proceedings of the 11th international conference on Computational logic in multi-agent systems
Speculative constraint processing for hierarchical agents
AI Communications - European Workshop on Multi-Agent Systems (EUMAS) 2009
On the implementation of speculative constraint processing
CLIMA'09 Proceedings of the 10th international conference on Computational logic in multi-agent systems
| Hi-index | 0.00 |
In multi-agents systems, incompleteness, due to either communication failure or response delay, is a major problem to handle. To face incompleteness, frameworks for speculative computation were proposed (see references [5, 6, 7]). The idea developed in such frameworks is to allow the asking agent, while waiting for the slave agents to reply, to reason using default beliefs until replies are sent. In particular, K. Satoh and K. Yamamoto [7] proposed a framework that allows an agent not only to perform speculative computation, but also to accept iterative answer revision for yes/no questions. In this paper, we present an extension of the framework for more general types of questions using constraint logic programming (CLP).