Newborn M. Automated Theorem Proving. Theory and Practice

Springer, 2001. — 244 p.This text and software package introduces readers to automated theorem proving, while providing two approaches implemented as easy-to-use programs. These are semantic-tree theorem proving and resolution-refutation theorem proving. The early chapters introduce first-order predicate calculus, well-formed formulae, and their transformation to clauses. Then the author goes on to show how the two methods work and provides numerous examples for readers to try their hand at theorem-proving experiments. Each chapter comes with exercises designed to familiarise the readers with the ideas and with the software, and answers to many of the problems.A Brief Introduction to COMPILE, HERBY, and THEO
Predicate Calculus, Well-Formed Formulas and Theorems
COMPILE: Transforming Well-Formed Formulas to Clauses
Inference Procedures
Proving Theorems by Contructing Closed Semantic Trees
Resolution-Refutation Proofs
HERBY: A Semantic-Tree Theorem Prover
Using HERBY
THEO: A Resolution-Refutation Theorem Prover
Using THEO
A Look at the Source Code of HERBY
A Look at the Source Code of THEO
The CADE ATP System Competitions and Other Theorem ProversA: Answers to Selected Exercises
B: List of Wffs and Theorems in the Directories WFFS, THEOREMS, GEOMETRY, and THMSMISC