Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
The Use of Lemmas in the Model Elimination O.L. Astrachan and D.W. Loveland
 

Summary: The Use of Lemmas in the Model Elimination
Procedure
O.L. Astrachan and D.W. Loveland
Department of Computer Science
Duke University
Durham, NC 27708-0129
919-660-6500
folajdwlg@cs.duke.edu
Abstract
When the Model Elimination ME procedure was rst proposed, a
notion of lemma was put forth as a promising augmentation to the basic
complete proof procedure. Here the lemmas that are used are also discov-
ered by the procedure in the same proof run. Several implementations of
ME now exist but only a 1970's implementation explicitly examined this
lemma mechanism, with indi erent results. We report on the successful
use of lemmas using the METEOR implementation of ME. Not only does
the lemma device permit METEOR to obtain proofs not otherwise ob-
tainable by METEOR, or any other ME prover not using lemmas, but
some well-known challenge problems are solved. We discuss several of
these more di cult problems, including two challenge problems for uni-

  

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

 

Collections: Computer Technologies and Information Sciences