Abstract |
In this paper, we propose an agent architecture for a combination of
speculative computation and abduction. Speculative computation
is a tentative computation when complete information for performing computation
is not obtained. We use a default value to complement such incomplete
information. Unlike usual default reasoning, the real value
for the information can be obtained during the computation and the computation can be revised
on the fly. In the previous work, we applied this technique to handling distributed problem solving
under incomplete communication environments in the context
of multi-agent systems and proposed correct procedures in
abductive logic programming in terms of perfect model semantics.
In the previous work, however, we regarded assumptions as defaults and
used these assumptions for speculative computation. Thus, we could
not perform hypothetical reasoning, that is, the original usage of
abduction.
In this paper, we extend our framework so that speculative
computation and abduction can be both performed. As a result,
our procedure becomes an extension of the abductive procedure
developed by Kakas and Mancarella augmented by dynamic belief revision
mechanism about outside world. |