Automated Theorem Proving Practice with Null Geometric Algebra

被引:0
|
作者
LI Hongbo [1 ]
机构
[1] Key Laboratory of Mathematics Mechanization, Academy of Mathematics and Systems Science, University of Chinese Academy of Sciences, Chinese Academy of Sciences
基金
中国国家自然科学基金;
关键词
Automated theorem discovering; automated theorem extending; automated theorem proving; Clifford bracket algebra; null geometric algebra;
D O I
暂无
中图分类号
O187 [代数几何];
学科分类号
0701 ; 070101 ;
摘要
This paper presents the practice of automated theorem proving in Euclidean geometry with null geometric algebra, a combination of Conformal Geometric Algebra and Grassmann-Cayley algebra. This algebra helps generating extremely short and readable proofs: The proofs generated are mostly one-termed or two-termed. Besides, the theorems are naturally extended from qualitative description to quantitative characterization by removing one or more geometric constraints from the hypotheses.
引用
收藏
页码:95 / 123
页数:29
相关论文
共 50 条