Journal ArticleDOI
A man-machine theorem-proving system
W. W. Bledsoe,Peter Bruell +1 more
Reads0
Chats0
TLDR
A man-machine theorem proving system at the University of Texas (Austin) which has been used to prove a few theorems in general topology, built around a modified form of IMPLY, a natural-deduction-like theorem proving technique.About:
This article is published in Artificial Intelligence.The article was published on 1974-01-01. It has received 68 citations till now. The article focuses on the topics: Theorem Proving System & Proof complexity.read more
Citations
More filters
Journal ArticleDOI
Algorithm = logic + control
TL;DR: The notion that computation = controlled deduction was first proposed by Pay Hayes and more recently by Bibel and Vaughn-Pratt and the thesis that algorithms be regarded as consisting of both logic and control components is explored.
Journal ArticleDOI
A Proof Procedure Using Connection Graphs
TL;DR: A new theorem-proving system designed to remedy deficiencies of resolution systems is presented, beginning as a supplement to SL-resolution in the form of classificatmn trees and incorporating an analogue of the Waltz algorithm for picture Interpretation.
Book ChapterDOI
The EVES System
TL;DR: In this paper, the authors discuss two applications of EVES, one of which is a proof of Jacobson's Theorem and the second one is an interpreter for a small programming language.
Journal ArticleDOI
Eurisko: A program that learns new heuristics and domain concepts
TL;DR: The EURISKO program embodies this language, and it is described in this paper, along with its results in eight task domains: design of naval fleets, elementary set theory and number theory, LISP programming, biological evolution, games in general, the design of three-dimensional VLSI devices, the discovery of heuristics which help the system discover heuristic, and theiscovery of appropriate new types of 'slots' in each domain.
Proceedings ArticleDOI
On proving inductive properties of abstract data types
TL;DR: The equational axioms of an algebraic specification of a data type often can be formed into a convergent set of rewrite rules, which leads to a new method of proof of inductive properties--not requiring the explicit invocation of an inductive rule of inference.
References
More filters
Journal ArticleDOI
Splitting and reduction heuristics in automatic theorem proving
TL;DR: A theorem proving program has been written in LISP which attempts to speed up automatic theorem proving by the use of heuristics, applicable to the proof of any theorem in mathematics, while others are designed for set theory.
Journal ArticleDOI
Computer proofs of limit theorems
TL;DR: In this article, some relatively simple concepts have been developed which, when incorporated into existing automatic theorem proving programs, enable them to prove efficiently a number of the limit theorems of elementary calculus, including the theorem that differentiable functions are continuous.
Journal ArticleDOI
Semi-Automated Mathematics
TL;DR: The fifth in a series of experiments in semi-automated mathematics is described in this paper, which culminated in large complex computer programs which allow a mathematician to prove mathematical theorems on an man/machine basis.
Journal ArticleDOI
A Human Oriented Logic for Automatic Theorem-Proving
TL;DR: A deductive system is described which combines aspects of resolution with that of natural deduction and whose performance compares favorably with the best predicate calculus theorem provers.
Journal ArticleDOI
Automatic Theorem Proving with Built-in Theories Including Equality, Partial Ordering, and Sets
TL;DR: Oxidizing butane to acetic acid which comprises contacting a sufficient concentration of an oxygen-containing gas with normal butane in the presence of catalyst consisting essentially of bromine and cobalt to initiate a self-sustaining exothermic reaction.