Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
CS--1993--25 The Use of Lemmas in the Model Elimination
 

Summary: CS--1993--25
The Use of Lemmas in the Model Elimination
Procedure
O.L. Astrachan and D.W. Loveland 1
Department of Computer Science
Duke University
Durham, North Carolina 27708--0129
December, 1993
1 This work is supported in part by NSF grants CCR­8900383 and CCR­9116203.

The Use of Lemmas in the Model Elimination Procedure
O.L. Astrachan and D.W. Loveland \Lambda
December, 1993
Abstract
When the Model Elimination (ME) procedure was first proposed, a notion of lemma was put forth
as a promising augmentation to the basic complete proof procedure. The lemmas that are used are also
discovered by the procedure in the same proof run. Several implementations of ME now exist but only a
1970's implementation explicitly investigated the lemma mechanism, with indifferent results. We report
on the METEOR implementation of ME and its very successful use of lemmas. Indeed, many theorems
have been proven by METEOR that have not been established by any other ME prover, and that are

  

Source: Astrachan, Owen - Department of Computer Science, Duke University

 

Collections: Computer Technologies and Information Sciences