Nothing Special   »   [go: up one dir, main page]

Skip to main content
Log in

Automated generation of readable proofs with geometric invariants

II. Theorem proving with full-angles

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

We present a set of rules based on full-angles as the basis of automated geometry theorem proving. We extend the idea of eliminating variables and points to the idea of eliminating lines. We also discuss how to combine the forward chaining and backward chaining to achieve higher efficiency. The prover based on the full-angle method has been used to produce short and elegant proofs for more than one hundred difficult geometry theorems. The proofs of many of those theorems produced by our previous area method are relatively long.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Bancilhon, F. and Ramakrishnan, R.: An Amateur's introduction to recursive query processing strategies, in C. Zanioilo (ed.), Proc. ACM SIGMOD Conf., 1986, pp. 16–52.

  2. Chou, S. C., Gao, X. S., and Zhang, J. Z.: Machine Proofs in Geometry, World Scientific, 1994.

  3. Chou, S. C., Gao, X. S., and Zhang, J. Z.: Automated generation of readable proofs with geometric invariants, I. Multiple and shortest proof generation, J. Automated Reasoning 17 (1996), 325–347 (this issue).

    Google Scholar 

  4. Chou, S. C., Gao, X. S., and Zhang, J. Z.: A Collection of 110 Geometry Theorems and Their Machine Proofs Based on Full-Angles, TR-94-4, CS Dept., WSU, Nov. 1994.

  5. Coelho, H. and Pereira, L. M.: Automated reasoning in geometry theorem proving with Prolog, J. Automated Reasoning 2 (1986), 329–390.

    Google Scholar 

  6. Gerlentner, H., Hanson, J. R., and Loveland, D. W.: Empirical explorations of the geometrytheorem proving machine, in Proc. Est. Joint Computer Conf., 1960, pp. 143–147.

  7. Gilmore, P. C.: An examination of the geometry theorem proving machine, Artificial Intelligence 1 (1988), 171–187.

    Google Scholar 

  8. Nevins, A. J.: Plane geometry theorem proving using forward chaining, Artificial Intelligence 6 (1977), 1–23.

    Google Scholar 

  9. Stickel, M.: A prolog technology theorem prover: Implementation by an extended prolog compiler, J. Automated Reasoning 4(4) (1985), 353–380.

    Google Scholar 

  10. Wen-tsün, Wu: Basic Principles of Mechanical Theorem Proving in Geometries, Vol. I: Part of Elementary Geometries, Science Press, Beijing, 1984 [in Chinese].

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

This work was supported in part by the NSF Grants CCR-9117870, CCR-9420857 and the Chinese NSF.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Chou, SC., Gao, XS. & Zhang, JZ. Automated generation of readable proofs with geometric invariants. J Autom Reasoning 17, 349–370 (1996). https://doi.org/10.1007/BF00283134

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF00283134

Key words

Navigation