• DocumentCode
    1823122
  • Title

    Automated production of traditional proofs for constructive geometry theorems

  • Author

    Chou, Shang-Ching ; Gao, Xiao-shan ; Zhang, Jing-Zhong

  • Author_Institution
    Dept. of Comput. Sci., Wichita State Univ., KS, USA
  • fYear
    1993
  • fDate
    19-23 Jun 1993
  • Firstpage
    48
  • Lastpage
    56
  • Abstract
    The authors present a method that can produce traditional proofs for a class of geometry statements whose hypotheses can be described constructively and whose conclusions can be represented by polynomial equations of three kinds of geometry quantities: ratios of lengths, areas of triangles, and Pythagoras differences of triangles. This class covers a large portion of the geometry theorems about straight lines and circles. The method involves the elimination of the constructed points from the conclusion using a few basic geometry propositions. The authors´ program, Euclid, implements this method and can produce traditional proofs of many hard geometry theorems. Currently, it has produced proofs of 400 nontrivial theorems entirely automatically, and the proofs produced are generally short and readable. This method seems to be the first one to produce traditional proofs for hard geometry theorems efficiently
  • Keywords
    computational geometry; theorem proving; constructive geometry theorems; geometry statements; nontrivial theorems; polynomial equations; traditional proofs; Computational geometry; Computer science; Logic functions; Operating systems; Polynomials; Production; Solids; Statistics; Timing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Logic in Computer Science, 1993. LICS '93., Proceedings of Eighth Annual IEEE Symposium on
  • Conference_Location
    Montreal, Que.
  • Print_ISBN
    0-8186-3140-6
  • Type

    conf

  • DOI
    10.1109/LICS.1993.287601
  • Filename
    287601