Speculative Constraint Processing with Iterative Revision for Disjunctive Answers
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  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).
KeywordsBelief Revision Default Rule Constraint Logic Programming Alternative Answer Ordinary Process
Unable to display preview. Download preview PDF.
- 2.Janson, S., Haridi, S.: Programming paradigms of the andorra kernel language. In: Proc. of ISLP 1991, pp. 167–186 (1991)Google Scholar
- 4.Sadri, F., Toni, F.: Interleaving belief revision and reasoning: Preliminary report. In: Proc. of Convegno Italiano di Logica Computazionale (CILC) (2005)Google Scholar
- 6.Satoh, K., Inoue, K., Iwanuma, K., Sakama, C.: Speculative computation by abduction under incomplete communication environments. In: Proc. of ICMAS 2000, pp. 263–270 (2000)Google Scholar
- 7.Satoh, K., Yamamoto, K.: Speculative computation with multi-agent belief revision. In: Proc. of AAMAS 2002, pp. 897–904 (2002)Google Scholar