Sciweavers

70
Voted
CADE
1992
Springer
15 years 26 days 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