Caching and Lemmaizing In Model Elimination Theorem Provers


Astrachan, O. L., & Stickel, M. E. (1992, June). Caching and lemmaizing in model elimination theorem provers. In International Conference on Automated Deduction (pp. 224-238). Springer, Berlin, Heidelberg.


Theorem provers based on the model elimination theorem-proving procedure 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.

Read more from SRI