The Unit Proof and the Input Proof in Theorem Proving
Author:
Open Access
- 1 October 1970
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 17 (4) , 698-707
Abstract
A resolution in which one of the two parent clauses is a unit clause is called a unit resolution, whereas a resolution in which one of the two parent clauses is an original input clause is called an input resolution. A unit (input) proof is a deduction of the empty clause □ such that every resolution in the deduction is a unit (input) resolution. It is proved in the paper that a set S of clauses containing its unit factors has a unit proof if and only if S has an input proof. A LISP program implementing unit resolution is described and results of experiments are given.Keywords
This publication has 8 references indexed in Scilit:
- A Formal Deductive Problem-Solving SystemJournal of the ACM, 1968
- Resolution With MergingJournal of the ACM, 1968
- The Concept of Demodulation in Theorem ProvingJournal of the ACM, 1967
- Automatic Theorem Proving With Renamable and Semantic ResolutionJournal of the ACM, 1967
- Theorem-Proving for Computers: Some Results on Resolution and RenamingThe Computer Journal, 1966
- Efficiency and Completeness of the Set of Support Strategy in Theorem ProvingJournal of the ACM, 1965
- A Machine-Oriented Logic Based on the Resolution PrincipleJournal of the ACM, 1965
- A Computing Procedure for Quantification TheoryJournal of the ACM, 1960