The search efficiency of theorem proving strategies

  • David A. Plaisted
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 814)

Abstract

We analyze the search efficiency of a number of common refutational theorem proving strategies for first-order logic. We show that most of them produce search spaces of exponential size even on simple sets of clauses, or else are not sensitive to the goal. We also discuss clause linking, a new procedure that uses a reduction to propositional calculus, and show that it, together with methods that cache subgoals, have behavior that is more favorable in some respects.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1994

Authors and Affiliations

  • David A. Plaisted
    • 1
    • 2
    • 3
  1. 1.Department of Computer ScienceUniversity of North Carolina at Chapel HillChapel Hill
  2. 2.MPI fuer InformatikSaarbruecken
  3. 3.Fachbereich InformatikUniversitaet KaiserslauternKaiserslautern

Personalised recommendations