G. Neugebauer. Lemma Usage in Connection Method Theorem Proving. Technical Report AIDA--91--08, FG Intellektik, FB Informatik, TH Darmstadt, April 1991.  Home/Search   Document Not in Database   Summary   Related Articles

....of a powerful pruning rule. Secondly, we will present a technique to use lemmata throughout a linear connection proof. Generating lemmata it is possible to use parts of a proof which have been generated once several times. This technique has been found extremely useful [Fro85, FC88, Neu91, AS92] in automated theorem proving. The use of lemmata becomes important during the generation of disjunctive plans. Considering conjunctive plans a linear connection proof consists of only one derivation chain. Thus, no lemmata can be generated throughout a proof. Generating disjunctive plans ....

....Mathematicians are using simple lemmas in order to prove complicated theorems. Whenever several applications of one lemma are necessary this approach corresponds to copying parts of the proof. This useful technique is known as factorization or lemmaizing in automated theorem proving [Fro85, FC88, Neu91, AS92] Generating disjunctive plans, partial plans may occur several times. Since one is interested in generating such parts of a plan only once, the use of lemmata becomes important. 5 Here, and in the following matrices the connections between literals representing conditions and resources ....

G. Neugebauer. Lemma Usage in Connection Method Theorem Proving. Technical Report AIDA--91--08, FG Intellektik, FB Informatik, TH Darmstadt, April 1991.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC