On the application of Buchberger's algorithm to automated geometry theorem proving

Citations of this article
Mendeley users who have this article in their library.


In this paper we present a new approach to automated geometry theorem proving that is based on Buchberger's Gröbner 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. © 1986, Academic Press Inc. (London) Ltd.. All rights reserved.




Kutzler, B., & Stifter, S. (1986). On the application of Buchberger’s algorithm to automated geometry theorem proving. Journal of Symbolic Computation, 2(4), 389–397. https://doi.org/10.1016/S0747-7171(86)80006-2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free