Skip to main content
Springer Nature Link
Log in

Automated Discovering and Proving for Geometric Inequalities

  • Conference paper
  • First Online:
Automated Deduction in Geometry (ADG 1998)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1669))

Included in the following conference series:

  • 379 Accesses

Abstract

Automated discovering and proving for geometric inequalities have been considered a difficult topic in the area of automated reasoning for manyy ears. Some well-known algorithms are complete theoreticallyb ut inefficient in practice, and cannot verify non-trivial propositions in batches. In this paper, we present an efficient algorithm to discover and prove a class of inequality-type theorems automatically by combining discriminant sequence for polynomials with Wu’s elimination and a partial cylindrical algebraic decomposition. Also this algorithm is applied to the classification of the real physical solutions of geometric constraint problems. Manygeom etric inequalities have been discovered byou r program, DISCOVERER, which implements the algorithm in Maple.

This work is supported in part by CAS and CNRS under a cooperative project between CICA and LEIBNIZ, and in part by the National “937” Project of China

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arnon, D. S., Geometric Reasoning with Logic and Algebra, Artificial Intelligence, 37, 37–60, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  2. Arnon, D. S., Collins, G. E. & McCallum, S., Cylindrical Algebraic Decomposition I: The Basic Algorithm, SIAM J. Comput., 13:4, 865–877, 1984. 37, 39

    Article  MathSciNet  Google Scholar 

  3. Arnon, D. S., Collins, G. E. & McCallum, S., Cylindrical Algebraic Decomposition II: An AdjacencyA lgorithm for the Plane, SIAM J.Comput., 13:4, 878–889, 1984. 37, 39

    Article  MathSciNet  Google Scholar 

  4. Bottema, O., et al., Geometric Inequalities, Wolters-Noordhoff Publ., Groningen, Netherland, 1969.

    MATH  Google Scholar 

  5. Buchberger, B., Applications of Gröbner Bases in Non-linear Computational Geometry, Geometric Reasoning, MIT Press, Cambridge, MA, pp. 413–446, 1989. 31

    Google Scholar 

  6. Buchberger, B., Collins, G. E. & Kutzler, B., Algebraic Methods for Geometric Reasoning, Annual Review of Computing Science, 3, 85–119, 1988. 31

    Article  MathSciNet  Google Scholar 

  7. Chen, M., Generalization of Discrimination System for Polynomials and its Applications, Ph.D dissertation, Sichuan University, Chengdu, China, 1998. (in Chinese) 33, 35

    Google Scholar 

  8. Chou, S. C., Mechanical Geometry Theorem Proving, D. Reidel Publ. Co., Amsterdam, 1988. 31

    MATH  Google Scholar 

  9. Chou, S. C., Gao, X. S. & Arnon, D. S., On the Mechanical Proof of Geometry Theorems Involving Inequalities, Advances in Computing Research, 6, JAI Press Inc., pp. 139–181, 1992. 31

    Google Scholar 

  10. Chou, S. C., Gao, X. S. & McPhee, N., A Combination of Ritt-Wu’s Method and Collins’s Method, Proc. of CADE-12, Springer-Verlag, pp. 401–415, 1994. 31

    Google Scholar 

  11. Chou, S. C., Gao, X. S. & Zhang, J. Z., Machine Proofs in Geometry, World Scientific Publ. Co., 1994. 31

    Google Scholar 

  12. Collins, G. E., Quantifier Elimination for Real Closed Fields byCy lindrical Algebraic Decomposition, Lecture Notes in Computer Science, 33, Springer-Verlag, pp. 134–183, 1975. 30

    Google Scholar 

  13. Collins, G. E. & Hong, H., Partial Cylindical Algebraic Decomposition for Quantifier Elimination, J. Symbolic Computation, 12, 299–328, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  14. Cox, D., Little, J. & O’Shea, D., Ideals, Varieties, and Algorithms, Springer-Verlag, 1992.

    Google Scholar 

  15. Folke, E., Which Triangles Are Plane Sections of Regular Tetrahedra? American Mathematics Monthly, 101, 788–789, 1994. 41

    Article  MATH  Google Scholar 

  16. Gao, X. S. & Cheng, H. F., On the Solution Classification of the “P3P” Problem, Proc. of ASCM’ 98, Z. Li (ed.), Lanzhou UniversityPress, pp. 185–200, 1998. 42

    Google Scholar 

  17. González-Vega, L., Lombardi, H., Recio, T. & Roy, M.-F., Sturm-Habicht Sequence, Proc. of ISSAC’ 89, ACM Press. pp. 136–146, 1989. 33, 35

    Google Scholar 

  18. Kapur, D., Automated Geometric Reasoning: Dixon Resultants, Gröbner Bases, and Characteristic Sets, Lecture Notes in Artificial Intelligence, 1360, Springer-Verlag, pp. 1–36, 1997. 31

    Google Scholar 

  19. Mitrinovic, D. S., Pecaric, J. E., & Volenec, V., Recent Advances in Geometric Inequalities, Kluwer Academic Publ., 1989. 31, 32, 44

    Google Scholar 

  20. Seidenberg A., A New Decision Method for ElementaryA lgebra, Annals of Mathematics, 60, 365–371, 1954. 30

    Article  MathSciNet  Google Scholar 

  21. Tarski, A., A Decision Method for Elementary Algebra and Geometry, University of California Press, Berkeley, 1951. 30

    MATH  Google Scholar 

  22. Wang, D. M., Elimination Procedures for Mechanical Theorem Proving in Geometry, Ann. Math. Artif. Intell., 13, 1–24, 1995. 31

    Article  MATH  Google Scholar 

  23. Wang, D. M., A Decision Method for Definite Polynomial, MM Research Preprints, No. 2, Beijing, pp. 68–74, 1987. 31

    Google Scholar 

  24. Winkler, F., Polynomial Algorithms in Computer Algebra, Springer-Verlag, Wien, 1996. 37, 39

    MATH  Google Scholar 

  25. Wu, W. T., On the Decision Problem and the Mechanization of Theorem-proving in ElementaryGeometry, Scientia Sinica, 21, 159–172, 1978. 30, 40

    MATH  MathSciNet  Google Scholar 

  26. Wu, W. T., Mechanical Theorem Proving in Geometries: Basic Principles (translated from the Chinese by X. Jin and D. Wang), Springer-Verlag, Wien, 1994. 30, 40

    MATH  Google Scholar 

  27. Yang, L., Practical Automated Reasoning on Inequalities: Generic Programs for InequalityPro ving and Discovering, Proc. of the Third Asian Technology Conference in Mathmatics, W.-C. Yang et al. (eds.), Springer-Verlag, pp. 24–35, 1998. 31

    Google Scholar 

  28. Yang, L., A Simplified Algorithm for Solution Classification of the Perspectivethree-Point Problem, MM Research Preprints, No. 17, Beijing, pp. 135–145, 1998. 42

    Google Scholar 

  29. Yang, L., Gao, X. S., Chou, S. C. & Zhang, J. Z., Automated Production of Readable Proofs for Theorems in Non-Euclidean Geometries, Lecture Notes in Artificial Intelligence, 1360, Springer-Verlag, pp. 171–188, 1997. 31

    Google Scholar 

  30. Yang, L., Hou, X. R. & Zeng, Z. B., A Complete Discrimination System for Polynomials, Science in China, Series E 39:6, 628–646, 1996. 31, 33, 34

    MATH  MathSciNet  Google Scholar 

  31. Yang, L. & Xia, B. C., Explicit Criterion to Determine the Number of Positive Roots of a Polynomial, MM Research Preprints, No. 15, Beijing, pp. 134–145, 1997. 31

    Google Scholar 

  32. Yang, L., Zhang, J. Z. & Hou, X. R., A Criterion of Dependencyb etween Algebraic Equations and Its Applications, Proc. of the 1992 International Workshop on Mathematics Mechanization, International Academic Publ., Beijing, pp. 110–134, 1992. 31

    Google Scholar 

  33. Yang, L., Zhang, J. Z. & Hou, X. R., An Efficient Decomposition Algorithm for GeometryT heorem Proving Without Factorization, Proc. of Asian Symposium on Computer Mathematics, H. Shi & H. Kobayashi (eds.), Scientists Incorporated, Japan, pp. 33–41, 1995. 32, 33, 40

    Google Scholar 

  34. Yang, L., Zhang, J. Z. & Hou, X. R., Nonlinear Algebraic Equation System and Automated Theorem Proving, Shanghai Scientific and Technological Education Publ. House, Shanghai, 1996. (in Chinese) 31, 32, 33, 40

    Google Scholar 

  35. Zhang, J. Z., Yang, L. & Hou, X. R., A Criterion for Dependency of Algebraic Equations with Applications to Automated Theorem Proving, Science in China, Series A 37, 547–554, 1994.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Chengdu Institute of Computer Applications Academia Sinica, Chengdu, 610041, China

    Lu Yang, Xiaorong Hou & Bican Xia

Authors
  1. Lu Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xiaorong Hou
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Bican Xia
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1999 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Yang, L., Hou, X., Xia, B. (1999). Automated Discovering and Proving for Geometric Inequalities. In: Automated Deduction in Geometry. ADG 1998. Lecture Notes in Computer Science(), vol 1669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47997-X_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-47997-X_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-66672-1

  • Online ISBN: 978-3-540-47997-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics