Realization of a geometry theorem proving machine

@inproceedings{Gelernter1995RealizationOA,
  title={Realization of a geometry theorem proving machine},
  author={Herbert L. Gelernter},
  booktitle={IFIP Congress},
  year={1995}
}
  • H. Gelernter
  • Published in IFIP Congress 26 October 1995
  • Computer Science
Introduction Few of those who have seen a modern high-speed digital computer digest and transform a mass of data in less time than it takes to follow the process in the mind can suppress a certain amount of speculation concerning the future of such machines. Under the assumption that the computer is operating at the mere threshhold of its capacity in performing the tasks we have thus far delegated to it, a long-range program directed at the problem of "intelligent" behavior and learning in… 

Empirical explorations of the geometry theorem machine

In early spring, 1959, an IBM 704 computer, with the assistance of a program comprising some 20 000 individual instructions, proved its first theorem in elementary Euclidean plane geometry. Since

Computer Theorem Proving for Verifiable Solving of Geometric Construction Problems

This paper presents a formal logical framework describing the traditional four phases process of geometric construction solving and shows how to put into practice well-known algebra-based methods and field theory, to prove RC-constructibility in the case of problems from Wernick's list.

The heuristic of George Polya and its relation to artificial intelligence

This paper attempts to understand why Polya's fundamental work in heuristic is well known and well regarded in artificial intelligence but no one has built seriously on his work, e.

Automated Theorem Proving and Its Prospects

In his recent books one of the main pre-occupations of Roger Penrose has been to show (to prove!) that computers are intrinsically limited, compared to humans, when it comes to the doing of

Solving Geometric Construction Problems Supported by Theorem Proving

This paper presents a formal logic framework describing the traditional four phases process of geometric construction solving and shows how to put into practice known methods based on algebra and, in particular, field theory, to prove RC-constructibility in the case of problems from Wernick's list.

Implementation of a geometry theorem proving package in SCRATCHPAD II

The first uniform implementation of all of these powerful provers based on characteristic sets and Grobner bases in the computer algebra system and language SCRATCHPAD II is reported on.

Search: A survey of recent results

Algebraic methods for geometric reasoning

The present survey reviews recent algebraic approaches to geometric reasoning and expects to see an enormous expansion of basic and applied research in geometric reasoning in the immediate future.

Handbook of satisfiability

A collection of papers on all theoretical and practical aspects of SAT solving will be extremely useful to both students and researchers and will lead to many further advances in the field.
...