Automated Reducible Geometric Theorem Proving and Discovery by Grobner Basis Method

被引:6
|
作者
Zhou, Jie [1 ]
Wang, Dingkang [2 ]
Sun, Yao [3 ]
机构
[1] Sci & Technol Commun Secur Lab, Chengdu 610041, Sichuan, Peoples R China
[2] Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100190, Peoples R China
[3] Chinese Acad Sci, Inst Informat Engn, Beijing 100093, Peoples R China
关键词
Zero divisor; True on components; Grobner basis; Geometric theorem proving; Geometric theorem discovery;
D O I
10.1007/s10817-016-9395-z
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we investigate the problem that the conclusion is true on some components of the hypotheses for a geometric statement. In that case, the affine variety associated with the hypotheses is reducible. A polynomial vanishes on some but not all the components of a variety if and only if it is a zero divisor in a quotient ring with respect to the radical ideal defined by the variety. Based on this fact, we present an algorithm to decide if a geometric statement is generally true or generally true on components by the Grobner basis method. This method can also be used in geometric theorem discovery, which can give the complementary conditions such that the geometric statement becomes true or true on components. Some reducible geometric statements are given to illustrate our method.
引用
收藏
页码:331 / 344
页数:14
相关论文
共 50 条