Using Gröbner bases to reason about geometry problems
Journal of Symbolic Computation
The algorithm description language ALDES (report)
ACM SIGSAM Bulletin
Using Gröbner bases to reason about geometry problems
Journal of Symbolic Computation
Geometry theorem proving using Hilbert's Nullstellensatz
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
Automated geometry theorem proving using Buchberger's algorithm
SYMSAC '86 Proceedings of the fifth ACM symposium on Symbolic and algebraic computation
Careful algebraic translations of geometry theorems
ISSAC '89 Proceedings of the ACM-SIGSAM 1989 international symposium on Symbolic and algebraic computation
Multilinear cayley factorization
Journal of Symbolic Computation
Geometry theorem proving in vector spaces by means of Gröbner bases
ISSAC '93 Proceedings of the 1993 international symposium on Symbolic and algebraic computation
A complete and practical algorithm for geometric theorem proving (extended abstract)
Proceedings of the eleventh annual symposium on Computational geometry
A survey of the Theorema project
ISSAC '97 Proceedings of the 1997 international symposium on Symbolic and algebraic computation
A New Approach for Automatic Theorem Proving in Real Geometry
Journal of Automated Reasoning
Interactive versus Symbolic Approaches to Plane Loci Generation in Dynamic Geometry Environments
ICCS '02 Proceedings of the International Conference on Computational Science-Part II
Remarks on Geometric Theorem Proving
ADG '00 Revised Papers from the Third International Workshop on Automated Deduction in Geometry
Computer algebra handbook
Journal of Symbolic Computation
Connecting the 3D DGS Calques3D with the CAS Maple
Mathematics and Computers in Simulation
Computational origami construction of a regular heptagon with automated proof of its correctness
ADG'04 Proceedings of the 5th international conference on Automated Deduction in Geometry
Towards a geometric-object-oriented language
ADG'04 Proceedings of the 5th international conference on Automated Deduction in Geometry
| Hi-index | 0.00 |
In this paper we present a new approach to automated geometry theorem proving that is based on Buchberger's Grobner bases method. The goal is to automatically prove geometry theorems whose hypotheses and conjecture can be expressed algebraically, i.e. by polynomial equations. After shortly reviewing the problem considered and discussing some new aspects of confirming theorems, we present two different methods for applying Buehberger's algorithm to geometry theorem proving, each of them being more efficient than the other on a certain class of problems. The second method requires a new notion of reduction, which we call pseudoreduction. This pseudoreduction yields results on polynomials over some rational function field by computations that are done merely over the rationals and, therefore, is of general interest also. Finally, computing time statistics on 70 non-trivial examples are given, based on an implementation of the methods in the computer algebra system SAC-2 on an IBM 4341.