๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Automatic theorem proving. I

โœ Scribed by A. A. Voronkov; A. I. Degtyarev

Publisher
Springer US
Year
1986
Tongue
English
Weight
932 KB
Volume
22
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

T-Theorem Proving I
T-Theorem Proving I
โœ Alberto Policriti; Jacob T. Schwartz ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 967 KB

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,

Renamable paramodulation for automatic t
Renamable paramodulation for automatic theorem proving with equality
โœ C.L. Chang ๐Ÿ“‚ Article ๐Ÿ“… 1970 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 825 KB

Roughly speaking, in automatic theorem proving with equality, paramodulation is a substitution rule for equality. In this paper, renamable resolution is extended to paramodulation. Renamable paramodulation is paramodulation of two clauses which become positive after an R-renaming. We prove.the R-ref

Refinements to depth-first iterative-dee
Refinements to depth-first iterative-deepening search in automatic theorem proving
โœ Xumin Nie; David A. Plaisted ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 639 KB

This paper will dzscuss two refinements to the depth-first tteratlve-deepemng search strategy The first refinement, the priority system, ts an attempt to simulate best-first search usmg depth-first tterattvedeepenmg search A new data structure, the priority hst, ts introduced mto depth-first tteratt

Automated theorem proving methods
Automated theorem proving methods
โœ Rolf Nossum ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Springer Netherlands ๐ŸŒ English โš– 780 KB