The search efficiency of theorem proving strategies
- Cite this paper as:
- Plaisted D.A. (1994) The search efficiency of theorem proving strategies. In: Bundy A. (eds) Automated Deduction — CADE-12. CADE 1994. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence (LNAI)), vol 814. Springer, Berlin, Heidelberg
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.
Unable to display preview. Download preview PDF.