## Caching and Lemmaizing in Model Elimination Theorem Provers (1992)

### Cached

### Download Links

- [www.cs.duke.edu]
- [www.cs.duke.edu]
- [www.cs.duke.edu]
- DBLP

### Other Repositories/Bibliography

by
Owen L. Astrachan
,
Mark E. Stickel

Citations: | 51 - 2 self |

### BibTeX

@MISC{Astrachan92cachingand,

author = {Owen L. Astrachan and Mark E. Stickel},

title = {Caching and Lemmaizing in Model Elimination Theorem Provers},

year = {1992}

}

### Years of Citing Articles

### OpenURL

### Abstract

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.