Sciweavers

CADE
1992
Springer
13 years 9 months ago
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 repor...
Owen L. Astrachan, Mark E. Stickel