Skip to main content
Log in

Recent advances in automated theorem proving on inequalities

  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Automated theorem proving on inequalities is always considered as a difficult topic in the area of automated reasoning. The relevant algorithms depend fundamentally on real algebra and real geometry, and the computational complexity increases very quickly with the dimension, that is, the number of parameters. Some well-known algorithms are complete theoretically but inefficient in practice, which cannot verify non-trivial propositions in batches. A dimension-decreasing algorithm presented here can treat radicals efficiently and make the dimensions the lowest. Based upon this algorithm, a generic program called “BOTTEMA” was implemented on a personal computer. More than 1000 algebraic and geometric inequalities including hundreds of open problems have been verified in this way. This makes it possible to check a finite many inequalities instead of solving a global-optimization problem.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Franklin J. Methods of Mathematical Economics. Springer-Verlag, New York, 1980, pp.222–223.

    MATH  Google Scholar 

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

    MATH  Google Scholar 

  3. Seidenberg A. A new decision method for elementary algebra.Annals of Mathematics, 1954, 60: 365–371.

    Article  MathSciNet  Google Scholar 

  4. Collins G E. Quantifier elimination for real closed fields by cylindrical algebraic decomposition. InLecture Notes in Computer Science. Springer-Verlag, Berlin, 1975, 33: 134–183.

    Google Scholar 

  5. Wu W T. On the decision problem and the mechanization of theorem-proving in elementary geometry.Sci. Sinica, 1978, 21: 159–172.

    MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  7. Chou S C. Mechanical Geometry Theorem Proving. D. Reidel Publishing Company, Amsterdam, 1988.

    MATH  Google Scholar 

  8. Wang D M. Elimination procedures for mechanical theorem proving in geometry.Ann. Math. Artif. Intell. 1995, 13: 1–24.

    Article  MATH  Google Scholar 

  9. Kapur D. Automated geometric reasoning: Dixon resultants. Gröbner bases, and characteristic sets. Springer’s LNAI 1360, 1997, pp.1–36.

  10. Buchberger B. Applications of Gröbner bases in non-liner computational geometry. InGeometric Reasoning, pp. 413–446. MIT Press, Cambridge, MA, 1989.

    Google Scholar 

  11. Buchberger B, Collins G E, Kutzler B. Algebraic methods for geometric reasoning.Annual Review of Computing Science, 1988, 3: 85–119.

    Article  MathSciNet  Google Scholar 

  12. Zhang J Z, Yang L, Deng M K. The parallel numerical method of mechanical theorem proving.Theoretical Computer Science, 1990, 74: 253–271.

    Article  MATH  MathSciNet  Google Scholar 

  13. Yang L, Zhang J Z, Li C Z. A prover for parallel numerical verification of a class of constructive geometry theorems. InProceedings of the 1992 International Workshop on Mathematics Mechanization, International Academic Publishers, 1992, pp.244–250.

  14. Yang L, Zhang J Z, Hou X R. A criterion of dependency between algebraic equations and its applications. InProceedings of the 1992 International Workshop on Mathematics Mechanization, International Academic Publishers, 1992, pp.110–134.

  15. Chou S C, Gao X S, Zhang J Z. Machine Proofs in Geometry. World Scientific Press, 1994.

  16. Zhang J Z, Yang L, Gao X S, Chou S C. Automated generation of readable proofs in geometry.Chinese J. Computers 1995, 18(5): 380–393 (in Chinese).

    Google Scholar 

  17. Yang L, Gao X S, Chou S C, Zhang J Z. Automated production of readable proofs for theorems in non-Euclidean geometries. Springer’s LNAI 1360, 1997, pp.171–188.

  18. Chou S C, Gao X S, Arnon D S. On the mechanical proof of geometry theorems involving inequalities.Advances in Computing Research, JAI Press Inc., 1992, 6: 139–181.

  19. Chou S C, Gao X S, McPhee N. A combination of Ritt-Wu’s method and Collins’s method. InProc. of CADE-12, Springer-Verlag, 1994, pp.401–415.

  20. W W T. On a finiteness theorem about problems involving inequalities.Sys. Sci. & Math. Scis., 1994, 7: 193–200.

    Google Scholar 

  21. W W T. On Global-Optimization Problems. InProc. ASCM’98 Lanzhou University Press, Lanzhou, 1998, pp.135–138.

    Google Scholar 

  22. Yang L, Hou X R, Zeng Z B. A complete discrimination system for polynomials.Science in China, Series E, 1996, 39(6): 628–646.

    MATH  MathSciNet  Google Scholar 

  23. Yang L, Zhang J Z, Hou X R. Non-Linear Equation Systems and Automated Theorem Proving. (in Chinese), Shanghai Press of Science, Technology and Education, 1996, Shanghai.

    Google Scholar 

  24. Yang L, Xia B C Explicit criterion to determine the number of positive roots of a polynomial.MM Research Preprints, 1997, 15: 134–145.

    Google Scholar 

  25. Mitrinovic D S, Pecaric J E, Volenec V. Recent Advances in Geometric Inequalities. Kluwer Academic Publishers, 1989.

  26. Yang L. Practical automated reasoning on inequalities: Generic programs for inequality proving and discovering. InProc. the Third Asian Technology Conference in Mathematics, Springer-Verlag, 1998, pp.24–35.

  27. Yang L. A Dimension-Decreasing Algorithm with Generic Program for Automated Inequality Proving.High Technology Letters, (in Chinese), 1998 8(7): 20–25.

    Google Scholar 

  28. Bottema Oet al. Geometric Inequalities. Wolters-Noordhoff Publishing, Groningen, Netherland, 1969.

    MATH  Google Scholar 

  29. Yang L, Zhang J Z. Searching dependency between algebraic equations: An algorithm applied to automated reasoning. InArtificial Intelligence in Mathematics, Johnson J, McKee S, Vella A (eds.), Oxford Univ. Press, Oxford, 1994, pp.147–156.

    Google Scholar 

  30. Zhang J Z, Yang L, Hou X R. A criterion for dependency of algebraic equations with applications to automated theorem proving.Sci. China, Ser. A, 1994, 37: 547–554.

    MATH  MathSciNet  Google Scholar 

  31. Janous W. Problem 1137.Crux Math. 1986, 12: 79, 177.

    Google Scholar 

  32. Shan Z. Geometric Inequality in China (ed.). Jiangsu Educational Publishing House, China, 1996. (in Chinese)

  33. Kuang J C.Applied Inequalities (in Chinese). 2nd ed., Human Educational Publishing House, China, 1993.

    Google Scholar 

  34. Yang L, Zhang J Z, Zeng Z B. On the conjectures and computing for the first several Heilbronn’s numbers.Chin. Ann. Math., 1992, A 13(4): 439–451.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yang Lu.

Additional information

Research supported in part by National ‘973’ Project of China and ‘95’ Key Project on Fundamental Research of Academia Sinica.

Yang Lu received his diploma in mathematics from Peking University in 1959. He is a Professor in computer science at Chengdu Institute of Computer Applications, Chinese Academy of Sciences. His major research interests include automated theorem proving, symbolic computation and intelligent software technology.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yang, L. Recent advances in automated theorem proving on inequalities. J. Comput. Sci. & Technol. 14, 434–446 (1999). https://doi.org/10.1007/BF02948785

Download citation

  • Issue Date:

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

Keywords

Navigation