Caching and Lemmaizing in Model Elimination Theorem Provers

Theorem provers based on model elimination have exhibited extremely high inference rates but have lacked a redundancy control mechanism such as subsumption. In this paper we report on work done to modify a model elimination theorem prover using two techniques, caching and lemmaizing, that have reduced by more than an order of magnitude the time required to find proofs of several problems and that have enabled the prover to prove theorems previously unobtainable by top-down model elimination theorem provers.

• Type: Conference
• Year: 1992
• Where: CADE
• Authors: Owen L. Astrachan, Mark E. Stickel
• Keywords: CADE 1992, Elimination Theorem Provers, Logical Reasoning, Model Elimination, Theorem Provers