Aquarius is a distributed theorem prover for first order logic with equality, developed for a network of workstations. Given as input a theorem proving problem and a number n of active nodes, Aquarius creates n deductive processes, one on each workstation, which work cooperatively toward the solution of the problem. Aquarius realizes a number of variants of a general methodology for distributed deduction, called deduction by Clause-Diffusion, which appeared first in (Bonacina 1992). The subdivision of the work among the processes, their activities and their cooperation are defined by the Clause-Diffusion method. Aquarius incorporates the sequential theorem prover Otter, in such a way that Aquarius implements the parallelization, according to the Clause-Diffusion methodology, of all the strategies provided in Otter. In this paper, we give first a brief outline of the Clause-Diffusion methodology, with emphasis on the problem of distributed global contraction, e.g. normalization with respect to a distributed data base. We describe the schemes for performing distributed global contraction implemented in Aquarius, which avoid the backward contraction bottleneck of purely shared memory approaches to parallel deduction. Then, we describe Aquarius, its design, its features and user interface. We present a set of experiments conducted with Aquarius and we analyze the results. We conclude with some comparison and discussion
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.