¡¡Chinese Journal of Computers   Full Text
  TitleAutomated Proving for a Class of Constructive Geometric Inequalities
  AuthorsYANG Lu1), 3) XIA Shi-Hong2)
  Address1)(Software Institute, Guangzhou University, Guangzhou 510405) 2)(Institute of Computing Technology, Chinese Academy of Sciences, Beijing 100080) 3)(Chengdu Institute of Computer Applications, Chinese Academy of Sciences, Chengdu 610041)
  Year2003
  IssueNo.7(769-778)
  Abstract &
  Background 		An automated inequality-proving algorithm is presented based on a mixed method including a so-called cell-decomposition. That is implemented by a Maple program named ¡°BOTTEMA¡± which can prove or disprove propositions in an extensive class of geometric and algebraic inequalities involving radicals. Most of the theorems in ¡°Geometric Inequalities¡±¡¡writed by Bottema et al., can be proven efficiently in this way.
keywords automated proving£» geometric inequality£» cell-decomposition£» semi-algebraic system