✦ LIBER ✦

T-Theorem Proving I

✍ Scribed by Alberto Policriti; Jacob T. Schwartz

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 967 KB
Volume: 20
Category: Article
ISSN: 0747-7171
DOI: 10.1006/jsco.1995.1053

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper we present a theoretical basis justifying the incorporation of decidability results for a first-order theory (T) into an automated theorem prover for (T). We state rules which extend resolution using decidability results relative to (T) in both the ground and the non-ground case, and prove the correctness and completeness of these rules. This is done by considering the ground case of such theories first, and then by applying a straightforward lifting argument. Examples are given illustrating the inference speedups which can be obtained by considering decision procedures with resolution-based inference.

📜 SIMILAR VOLUMES

Automatic theorem proving. I

✍ A. A. Voronkov; A. I. Degtyarev 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 932 KB

Automated theorem proving methods

✍ Rolf Nossum 📂 Article 📅 1985 🏛 Springer Netherlands 🌐 English ⚖ 780 KB

The t-variable method in gentzen-style a

The t-variable method in gentzen-style automatic theorem proving

✍ Tryggvi Edwald 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 517 KB

Completely non-clausal theorem proving

✍ Neil V. Murray 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 812 KB

The proof procedure we describe operates on quantifier-free formulas of the predicate calculus which are not truth-functionally normalized in any way. The procedure involves a single inference rule called NC-resolution, and is shown to be complete. Completeness is also obtained for a simple restrict

Computer Theorem Proving in Mathematics

✍ Carlos Simpson 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 144 KB

Proving theorems by reuse

✍ Christoph Walther; Thomas Kolbe 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 444 KB

We investigate the improvement of theorem proving by reusing previously computed proofs. We have developed and implemented the PLAGIATOR system which proves theorems by mathematical induction with the aid of a human advisor: If a base or step formula is submitted to the system, it tries to reuse a p