Speculative Constraint Processing with Iterative Revision for Disjunctive Answers

Abstract

Abstract. 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 [5,6,4]). The idea developed in such frameworks is to allow the asking agent, while waiting for slave agents to reply, to reason using default belief until replies are sent. In [6] in particular, a framework is proposed, that allows an agent not only to perform speculative computation but also to accept iterative answer revision, in the case of yes/no questions. In this paper, we present an extension of the framework in the case of more general types of questions using constraint logic programming (CLP).

Distributed Defeasible Speculative Reasoning in Ambient Environment

“…While most of the previous work in speculative computation [14][15][16][17] required agents to be arranged in a hierarchical order such that queries can only be sent from agents in the higher level of the hierarchy to the one in the lower level, our approach does not have this requirement. Agents in the ambient environment can continuously gather and update their beliefs with acquired new information and responses to the external environment.…”

“…It features the possibility of reusing parts of the computation already done during the phases when answers arrive and answer revision is required, as the partially computed suspend process may become active again and resume its computation. Since then the framework has been extended to support more general MAS that are hierarchically structured [14][15][16][17].…”

Franco-Japanese research collaboration on constraint programming

“…As the first step for this purpose, we incorporated belief revision into speculative constraint processing [5]. In the previous method of speculative constraint processing, slave agents were assumed to send at most one final answer.…”