{"type":"ScholarlyArticle","title":"A Definition-Driven Theorem Prover","authors":[{"name":"George W. Ernst","slug":"george-w-ernst","given":"George W.","family":"Ernst","affiliation":""}],"abstract":"This paper describes a theorem prover, running on a PDP-10-TENEX system, that can prove some theorems whose statements involve a relatively large number of definitions. Such theorems require special methods because (1) their statements contain a large number of clauses and (2) their proofs are quite long although straight-forward. A theorem is proven by first subdividing it into \"simple\" subgoals and then using a standard resolution theorem prover to prove the subgoals. The first part of this process involves the substitution of definitions for defined quantities and the use of logical simplification. This process which is more similar to a natural deduction system than a resolution system, is shown to be complete when restricted to first-order logic. However, the theorem prover can deal with some interesting higher-order theorems as is shown by an example.","doi":null,"url":"https://ijcai.org/proceedings/1973/8","pdf":"https://ijcai.org/proceedings/1973/0008.pdf","markdown":"https://ijcai.org/proceedings/1973/8.md","bibtex":"https://ijcai.org/proceedings/1973/bibtex/8","volume":{"slug":"1973","title":"Proceedings of the Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1973","url":"https://ijcai.org/proceedings/1973/","year":1973,"location":"Stanford, California, USA","dates":"20-23 August 1973","editors":"Nils J. Nilsson","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Theorem Proving and Logic: 1","track":"Theorem Proving and Logic: 1","number":8,"pages":{"first":51,"last":54},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}