Abstract
This paper describes a practical algorithm for the problem of geometric theorem proving. Our work is motivated by several recent improvements in algorithms for sign determination and symbolic-numeric computation. Based on these, we provide an algorithm for solving triangular systems efficiently using straight-line program arithmetic. The geometric theorem prover so obtained works over both real closed and algebraic closed fields and handles the problem of degeneracy via the use of randomisation. The report concludes with a description of an implementation and provides preliminary benchmarks from the same.
Supported by a David and Lucile Packard Foundation Fellowship and by NSF P.Y.I. Grant IRI-8958577
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Bibliography
J.F. Canny. An improved sign determination algorithm. In AAECC-91, 1991. New Orleans.
John Canny. A toolkit for non-linear algebra. (manuscript), 1993.
S.-C. Chou. Proving elementary geometry theorems using Wu's algorithm. In W.W. Bledsoe and D.W. Loveland, editors, Theorem Proving: After 25 Years. American Mathematical Society, 1984.
S.-C. Chou. Mechanical geometry theorem proving. Mathematics and its applications. D. Reidel, Holland, 1988.
H. Coelho and L.M. Pereira. Automated reasoning in geometry theorem proving with PROLOG. J. Automated Reasoning, 2:329–390, 1986.
H. Gelernter. Realization of a geometry theorem proving machine. In E.A. Feigenbaum and J.E. Feldman, editors, Computers and Thought. McGraw-Hill, New York, 1963.
D. Kapur. A refutational approach to geometry theorem proving. In D. Kapur and J.L. Mundy, editors, Geometric Reasoning. MIT Press, 1988.
H.-P. Ko. Geometry theorem proving by decomposition of semi-algebraic sets — an application of Wu's structure theorem. In International Workshop on Geometry Reasoning, 1986. Oxford, England.
B. Kutzler and S. Stifter. On the application of Buchberger's algorithm to automated geometry theorem proving. J. Symbolic Comput., 2:409–420, 1986.
A. Rege and J. Canny. A practical algorithm for geometric theorem proving. In preparation, 1994.
J. Renegar. On the computational complexity and geometry of the first-order theory of the reals, parts I, II and III. Technical Report 852,855,856, Cornell University, Operations Research Dept., 1989.
W. Wu. On the decision problem and mechanization of theorem proving in elementary geometry. Sci. Sinica, 21:150–172, 1978.
W. Wu. Some recent advances in mechanical theorem proving of geometries. In W.W. Bledsoe and D.W. Loveland, editors, Theorem Proving: After 25 Years. American Mathematical Society, 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rege, A., Canny, J. (1995). A practical algorithm for geometric theorem proving. In: Calmet, J., Campbell, J.A. (eds) Integrating Symbolic Mathematical Computation and Artificial Intelligence. AISMC 1994. Lecture Notes in Computer Science, vol 958. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60156-2_2
Download citation
DOI: https://doi.org/10.1007/3-540-60156-2_2
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60156-2
Online ISBN: 978-3-540-49533-8
eBook Packages: Springer Book Archive