MPI-INF/SWS Research Reports 1991-2017

2. Number - only D2


The search efficiency of theorem proving strategies: an analytical comparison

Plaisted, David A.

July 1994, 40 pages.

Status: available - back from printing

We analyze the search efficiency of a number of common refutational theorem proving strategies for first-order logic. Search efficiency is concerned with the total number of proofs and partial proofs generated, rather than with the sizes of the proofs. We show that most common strategies produce search spaces of exponential size even on simple sets of clauses, or else are not sensitive to the goal. However, clause linking, which uses a reduction to propositional calculus, has behavior that is more favorable in some respects, a property that it shares with methods that cache subgoals. A strategy which is of interest for term-rewriting based theorem proving is the A-ordering strategy, and we discuss it in some detail. We show some advantages of A-ordering over other strategies, which may help to explain its efficiency in practice. We also point out some of its combinatorial inefficiencies, especially in relation to goal-sensitivity and irrelevant clauses. In addition, SLD-resolution, which is of importance for Prolog implementation, has combinatorial inefficiencies; this may suggest basing Prolog implementations on a different theorem proving strategy.

  • Attachement: MPI-I-94-233.dvi (210 KBytes); (423 KBytes); MPI-I-94-233.pdf (343 KBytes)

URL to this document:

Hide details for BibTeXBibTeX
  AUTHOR = {Plaisted, David A.},
  TITLE = {The search efficiency of theorem proving strategies: an analytical comparison},
  TYPE = {Research Report},
  INSTITUTION = {Max-Planck-Institut f{\"u}r Informatik},
  ADDRESS = {Im Stadtwald, D-66123 Saarbr{\"u}cken, Germany},
  NUMBER = {MPI-I-94-233},
  MONTH = {July},
  YEAR = {1994},
  ISSN = {0946-011X},