Abstract
Gröbner bases have been used in various ways for dealing with the problem of geometry theorem proving as posed by Wu. Kutzler and Stifter have proposed a procedure centered around the computation of a basis for the module of syzygies of the geometrical hypotheses. We elaborate this approach and extend it to a complete decision procedure. Also, in geometry theorem proving the problem of constructing subsidiary (or degeneracy) conditions arises. Such subsidiary conditions usually are not uniquely determined and obviously one wants to keep them as simple as possible. This problem, however, has not received enough attention in the geometry theorem proving literature. Our algorithm is able to construct the simplest subsidiary conditions with respect to certain predefined criteria, such as lowest degree or dependence on a given set of variables.
Work reported herein has been supported by the Österreichische Forschungsgemeinschaft.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
B. Buchberger: Ein Algorithmus zum Auffinden der Basiselemente des Restklassen-ringes nach einem nulldimensionalen Polynomideal. Ph.D. dissertation, Univ. Innsbruck, Austria (1965).
B. Buchberger: “Gröbner Bases: An Algorithmic Method in Polynomial Ideal Theory”, in: Multidimensional Systems Theory, N.K. Bose, ed., 184–232, D. Reidel Publ. Comp. (1985).
S.-C. Chou: Proving and Discovering Theorems in Elementary Geometry Using Wu's Method, Ph.D. Thesis, Dept. of Mathematics, University of Texas, Austin (1985)
S.-C. Chou, W.F. Schelter: “Proving Geometry Theorems with Rewrite Rules”, J. Automated Reasoning 2, 253–273 (1986)
S.-C. Chou, J.-G. Yang: “On the Algebraic Formulation of Geometry Theorems”, Techn. Rep., Inst. for Computer Science, Univ. of Texas, Austin (1986).
A. Kandri-Rody: Effective Methods in the Theory of Polynomial Ideals, Ph.D. thesis, Rensselaer Polytechnic Institute, Troy, NY (1984).
D. Kapur: “Geometry Theorem Proving Using Hilbert's Nullstellensatz”, Proc. SYM-SAC'86, 202–208, B.W. Char, ed., ACM (1986).
D. Kapur: “Using Gröbner Bases to Reason About Geometry Problems”, J. of Symbolic Computation 2/4, 399–408 (1986).
B. Kutzler, S. Stifter: “Automated Geometry Theorem Proving Using Buchberger's Algorithm”, Proc. 1986 Symp. on Symbolic and Algebraic Computation (SYMSAC'86), 209–214, B.W. Char (ed.), ACM, New York (1986).
B. Kutzler, S. Stifter: “On the Application of Buchberger's Algorithm to Automated Geometry Theorem Proving”, J. of Symbolic Computation 2/4, 389–397 (1986).
W. Trinks: “Über B. Buchbergers Verfahren, Systeme algebraischer Gleichungen zu lösen”, J. of Number Theory 10/4, 475–488 (1978).
F. Winkler: Solution of Equations I: Polynomial Ideals and Gröbner Bases, lecture notes of the short course on “Symbolic and Algebraic Computation”, Conf. “Computers & Mathematics”, Stanford Univ. (1986).
Wu Wen-tsün: “On the Decision Problem and the Mechanization of Theorem Proving in Elementary Geometry”, Scientia Sinica 21, 157–179 (1978).
Wu Wen-tsün: “Basic Principles of Mechanical Theorem-Proving in Elementary Geometry”, J. Syst. Sci. & Math. Sci. 4/3, 207–235 (1984).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Winkler, F. (1989). A geometrical decision algorithm based on the gröbner bases algorithm. In: Gianni, P. (eds) Symbolic and Algebraic Computation. ISSAC 1988. Lecture Notes in Computer Science, vol 358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-51084-2_34
Download citation
DOI: https://doi.org/10.1007/3-540-51084-2_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51084-0
Online ISBN: 978-3-540-46153-1
eBook Packages: Springer Book Archive