指数多项式不等式的自动证明

发布时间：2018-03-27 17:25

本文选题：指数多项式不等式　切入点：自动证明　出处：《系统科学与数学》2017年07期

【摘要】：讨论了指数多项式不等式的自动证明问题,运用Taylor展开式将目标不等式的证明转化为一系列的一元多项式不等式的验证,然后借助代数不等式证明工具(如Bottema)完成最后的工作.运用Maple实现了上述算法,算法对所有指数多项式不等式终止,并且可以输出"可读"的证明过程.
[Abstract]:In this paper, the problem of automatic proof of exponential polynomial inequality is discussed. The proof of objective inequality is transformed into a series of univariate polynomial inequalities by Taylor expansion. Then the last work is accomplished by means of algebraic inequality proof tools (such as Bottema). The algorithm is implemented by Maple, which terminates all exponential polynomial inequalities and can output the proof process of "readable".
【作者单位】：中国民航飞行学院德阳校区-四川省商贸学校;乐山职业技术学院;
【基金】：德阳市校(院,所)市科技合作计划资助课题
【分类号】：O174.14

【相似文献】