Advertisement

A practical algorithm for geometric theorem proving

  • Ashutosh Rege
  • John Canny
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 958)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. [1]
    J.F. Canny. An improved sign determination algorithm. In AAECC-91, 1991. New Orleans.Google Scholar
  2. [2]
    John Canny. A toolkit for non-linear algebra. (manuscript), 1993.Google Scholar
  3. [3]
    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.Google Scholar
  4. [4]
    S.-C. Chou. Mechanical geometry theorem proving. Mathematics and its applications. D. Reidel, Holland, 1988.Google Scholar
  5. [5]
    H. Coelho and L.M. Pereira. Automated reasoning in geometry theorem proving with PROLOG. J. Automated Reasoning, 2:329–390, 1986.CrossRefMathSciNetGoogle Scholar
  6. [6]
    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.Google Scholar
  7. [7]
    D. Kapur. A refutational approach to geometry theorem proving. In D. Kapur and J.L. Mundy, editors, Geometric Reasoning. MIT Press, 1988.Google Scholar
  8. [8]
    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.Google Scholar
  9. [9]
    B. Kutzler and S. Stifter. On the application of Buchberger's algorithm to automated geometry theorem proving. J. Symbolic Comput., 2:409–420, 1986.Google Scholar
  10. [10]
    A. Rege and J. Canny. A practical algorithm for geometric theorem proving. In preparation, 1994.Google Scholar
  11. [11]
    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.Google Scholar
  12. [12]
    W. Wu. On the decision problem and mechanization of theorem proving in elementary geometry. Sci. Sinica, 21:150–172, 1978.Google Scholar
  13. [13]
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Ashutosh Rege
    • 1
  • John Canny
    • 1
  1. 1.Computer Science DivisionUniversity of CaliforniaBerkeley

Personalised recommendations