The authors present a method that can produce traditional proofs for a class of geometry statements whose hypotheses can be described constructively and whose conclusions can be represented by polynomial equations of three kinds of geometry quantities: ratios of lengths, areas of triangles, and Pythagoras differences of triangles. This class covers a large portion of the geometry theorems about straight lines and circles. The method involves the elimination of the constructed points from the conclusion using a few basic geometry propositions. The authors' program, Euclid, implements this method and can produce traditional proofs of many hard geometry theorems. Currently, it has produced proofs of 400 nontrivial theorems entirely automatically, and the proofs produced are generally short and readable. This method seems to be the first one to produce traditional proofs for hard geometry theorems efficiently.<<ETX>>
[1]
A. J. Nevins,et al.
Plane Geometry Theorem Proving Using Forward Chaining
,
1975,
Artif. Intell..
[2]
D. Loveland,et al.
Empirical explorations of the geometry-theorem proving machine
,
1995
.
[3]
John R. Anderson,et al.
The Geometry Tutor
,
1985,
IJCAI.
[4]
Deepak Kapur,et al.
Geometry theorem proving using Hilbert's Nullstellensatz
,
1986,
SYMSAC '86.
[5]
Larry Wos,et al.
Problems and Experiments for and with Automated Theorem-Proving Programs
,
1976,
IEEE Transactions on Computers.
[6]
L. Roth,et al.
Modern Geometry
,
1961,
Nature.
[7]
Sabine Stifter,et al.
Automated geometry theorem proving using Buchberger's algorithm
,
1986,
SYMSAC '86.
[8]
S. Chou.
Mechanical Geometry Theorem Proving
,
1987
.