Accession Number : AD0667282

Title :   A SIMPLIFIED FORMAT FOR THE MODEL ELIMINATION THEOREM-PROVING PROCEDURE,

Corporate Author : CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE

Personal Author(s) : Loveland,D. W.

Report Date : DEC 1967

Pagination or Media Count : 38

Abstract : The paper presents an alternate approach to the formulation of the Model Elimination proof procedure presented in another paper. By exploiting fully the ability to linearize the procedure format (isolating the format from a tree structure form) and by representing lemmas by clauses, the description of the Model Elimination procedure is greatly simplified. (Author)

Descriptors :   (*MATHEMATICAL LOGIC, THEOREMS), SET THEORY, ALGORITHMS, PROBLEM SOLVING

Subject Categories : Operations Research

Distribution Statement : APPROVED FOR PUBLIC RELEASE