[1]YANG Lu,YU Wensheng.Automated proving of some fundamental applied inequalities[J].CAAI Transactions on Intelligent Systems,2011,6(5):377-390.
Copy
CAAI Transactions on Intelligent Systems[ISSN 1673-4785/CN 23-1538/TP] Volume:
6
Number of periods:
2011 5
Page number:
377-390
Column:
学术论文—人工智能基础
Public date:
2011-10-30
- Title:
-
Automated proving of some fundamental applied inequalities
- Author(s):
-
YANG Lu; YU Wensheng
-
Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai 200062, China
-
- Keywords:
-
fundamental applied inequalities; automated proving; inequalityproving package BOTTEMA; Tarski model
- CLC:
-
TP181
- DOI:
-
-
- Abstract:
-
The automated proving of inequalities is always a difficult and hot topic in the field of intelligence systems. In this paper, by means of an inequalityproving package called BOTTEMA, the automated proving for some fundamental applied inequalities is successfully implemented. These inequalities include the arithmeticgeometricharmonic inequality, arrangement inequality, Chebyshev inequality, Bernoulli inequality, triangle inequality, and Jensen inequality, beyond the Tarski model, where the number of variables of the inequality is also a variable. The conclusions obtained from automated proving sometimes may extend the known results; and the method would be of use for analogous types of inequalities. The effectiveness of the algorithm and package is illustrated by some more examples.