The problem of automatically proving geometric theorems has gained a lot of attention in the last two years. Following the general approach of translating a given geometric theorem into an algebraic one, various powerful provers based on characteristic sets and Grobner bases have been implemented by groups at Academia Sinica Bejing (China), U. Texas at Austin (USA), General Electric Schenectady (USA), and Research Institute for Symbolic Computation Linz (Austria). So far, fair comparisons of the various provers were not possible, because the underlying hardware and the underlying algebra systems differed greatly. This paper reports on the first uniform implementation of all of these provers in the computer algebra system and language SCRATCHPAD II. We summarize the recent achievements in the area of automated geometry theorem proving, shortly review the SCRATCHPAD II system, describe the implementation of the geometry theorem proving package, and finally give a computing time statistics of 24 examples.
[1]
Stephen M. Watt,et al.
Scratchpad II: An Abstract Datatype System for Mathematical Computation
,
1988,
Trends in Computer Algebra.
[2]
Bruno Buchberger,et al.
Applications of Gro¨bner bases in non-linear computational geometry
,
1988
.
[3]
Deepak Kapur,et al.
Geometry theorem proving using Hilbert's Nullstellensatz
,
1986,
SYMSAC '86.
[4]
Sabine Stifter,et al.
Automated geometry theorem proving using Buchberger's algorithm
,
1986,
SYMSAC '86.
[5]
B. Buchberger,et al.
Grobner Bases : An Algorithmic Method in Polynomial Ideal Theory
,
1985
.
[6]
Philip J. Davis,et al.
Formac Meets Pappus Some Observations on Elementary Analytic Geometry by Computer
,
1969
.
[7]
H. Gelernter,et al.
Realization of a geometry theorem proving machine
,
1995,
IFIP Congress.
[8]
N. Bose.
Multidimensional Systems Theory
,
1985
.