Conditional Answer Computation in SOL as Speculative Computation in Multi-Agent Environments

Abstract

In this paper, we study speculative computation in a master-slave multi-agent system where reply messages sent from slave agents to a master are always tentative and may change from time to time. In this system, default values used in speculative computation are only partially determined in advance. Inoue et al. [8] formalized speculative computation in such an environment with tentative replies, using the framework of a first-order consequence-finding procedure SOL with the well-known answer literal method. We shall further refine the SOL calculus, using conditional answer computation and skip-preference in SOL. The conditional answer format has an great advantage of explicitly representing how a conclusion depends on tentative replies and defaults, both of which are used to derive the conclusion. The dependency representation is significantly important to avoid unnecessary recomputation of tentative conclusions. The skip-preference has the great ability of preventing irrational/redundant derivations.