Concurrent constraint programming
Concurrent constraint programming
Experiments with speculative parallelism in Parlog
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
Speculative computation with multi-agent belief revision
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 2
The Distributed Constraint Satisfaction Problem: Formalization and Algorithms
IEEE Transactions on Knowledge and Data Engineering
Speculative Computation by Abduction under Incomplete Communication Environments
ICMAS '00 Proceedings of the Fourth International Conference on MultiAgent Systems (ICMAS-2000)
Agent-Based Approach to Dynamic Meeting Scheduling Problems
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 3
Adopt: asynchronous distributed constraint optimization with quality guarantees
Artificial Intelligence - Special issue: Distributed constraint satisfaction
Constraint-based reasoning and privacy/efficiency tradeoffs in multi-agent problem solving
Artificial Intelligence - Special issue: Distributed constraint satisfaction
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 constraint processing for hierarchical agents
AI Communications - European Workshop on Multi-Agent Systems (EUMAS) 2009
| Hi-index | 0.00 |
In this paper, we extend our framework of speculative computation in multi-agent systems by introducing default constraints. In research on multi-agent systems, handling incomplete information due to communication failure or due to other agents' delay in communication is a very important issue. For a solution to this problem, we previously proposed speculative computation based on abduction in the context of master-slave multi-agent systems and gave a procedure in abductive logic programming. In our previous proposal, a master agent prepares a default value for a yes/no question in advance, and it performs speculative computation using the default without waiting for a reply to the question. This computation is effective unless the contradictory reply to the default is returned. In this paper, we formalize speculative constraint processing, and propose a correct operational model for such computation so that we can handle not only yes/no questions, but also more general types of questions.