Issue No. 01 - January (1981 vol. 3)
Philip T. Cox , Department of Computer Science, University of Waterloo, Waterloo, Ont., Canada; Department of Computer Science, Auckland University, Auckland, Australia.
Tomasz Pietrzykowski , School of Computer Science, Acadia University, Wolfville, N.S., Canada.
A proof procedure is described that relies on the construction of certain directed graphs called ``deduction plans.'' Plans represent the structure of proofs in such a way that problem reduction may be used without imposing any ordering on the solution of subproblems, as required by other systems. The structure also allows access to all clauses deduced in the course of a proof, which may then be used as lemmas. Economy of representation is the maximum attainable, consistent with this unrestricted availability of lemmas. Restricted versions of this deduction system correspond to existing linear deduction procedures, but do not suffer from some of their shortcomings, such as redundant representation, strict ordering of subproblems, and explicit substitution. One of the rules for constructing plans, however, allows a subproblem to be factored to a previously solved one: this has no equivalent in existing system. A further economy is obtained by making it unnecessary to perform substitutions and calculate most general unifiers. The source of unification failure can be located when a subproblem is found to be unsolvable, so that exact backtracking can be performed rather than the blind backtracking performed by existing systems. Therefore, a deduction system based on the construction of plans can avoid the wasteful search of irrelevant areas of the search space that results from the usual backtracking methods.
P. T. Cox and T. Pietrzykowski, "Deduction Plans: A Basis for Intelligent Backtracking," in IEEE Transactions on Pattern Analysis & Machine Intelligence, vol. 3, no. , pp. 52-65, 1981.