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

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)

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1967
Accession Number
AD0667282

Entities

People

  • D. W. Loveland

Organizations

  • Carnegie Mellon University

Tags

DTIC Thesaurus Topics

  • Elimination

Readers

  • Business Analytics
  • Mathematical Modeling and Probability Theory.
  • Systems Analysis and Design