期刊文献+
共找到1篇文章
< 1 >
每页显示 20 50 100
Geometry Theorem Proving by Decomposing Polynomial System into Strong Regular Sets 被引量:1
1
作者 Yong-BinLi WuLiu] Xiao-LinXiang 《Journal of Computer Science & Technology》 SCIE EI CSCD 2004年第6期820-827,共8页
This paper presents a complete method to prove geometric theorem by decomposing the corresponding polynomial system. into strong regular sets, by which one can compute some components for which the geometry theorem is... This paper presents a complete method to prove geometric theorem by decomposing the corresponding polynomial system. into strong regular sets, by which one can compute some components for which the geometry theorem is true and exclude other components for which the geometry theorem is false. Two examples are given to show that the geometry theorems are conditionally true for some components which are excluded by other methods. 展开更多
关键词 zero decomposition strong regular set automated geometry theorem proving subsidiary condition
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部