A review and prospect of readable machine proofs for geometry theorems

被引:24
作者
Jiang, Jianguo [1 ]
Zhang, Jingzhong [2 ,3 ]
机构
[1] Liaoning Normal Univ, Sch Math, Dalian 116029, Peoples R China
[2] Univ Elect Sci & Technol China, Lab Comp Reasoning & Trustworthy Comput, Chengdu 610054, Peoples R China
[3] Chinese Acad Sci, Chengdu Inst Comp Applicat, Chengdu 610041, Peoples R China
关键词
Automated geometry reasoning; coordinate-free method; formal logic method; geometric inequality; intelligent geometry software; machine learning; mechanical theorem proving; readable machine proof; search method; AUTOMATED GENERATION; TRADITIONAL PROOFS; INVARIANTS;
D O I
10.1007/s11424-012-2048-3
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
After half a century research, the mechanical theorem proving in geometries has become an active research topic in the automated reasoning field. This review involves three approaches on automated generating readable machine proofs for geometry theorems which include search methods, coordinate-free methods, and formal logic methods. Some critical issues about these approaches are also discussed. Furthermore, the authors propose three further research directions for the readable machine proofs for geometry theorems, including geometry inequalities, intelligent geometry softwares and machine learning.
引用
收藏
页码:802 / 820
页数:19
相关论文
共 109 条
[1]  
Anderson J., 1981, P IJCAI 81 VANC
[2]  
Anderson J., 1985, P IJCAI 85 LOS ANG
[3]  
[Anonymous], 1984, BASIC PRINCIPLES MEC
[4]  
[Anonymous], 1971, Foundations of geometry
[5]  
[Anonymous], 1988, Mechanical Geometry Theorem Proving
[6]  
[Anonymous], 1994, MACHINE PROOFS GEOME, DOI DOI 10.1142/9789812798152
[7]   GEOMETRIC REASONING WITH LOGIC AND ALGEBRA [J].
ARNON, DS .
ARTIFICIAL INTELLIGENCE, 1988, 37 (1-3) :37-60
[8]  
Bottema O., 1969, GEOMETRIC INEQUALITI
[9]  
Buchberger B., 1995, ANN REV COMPUTER SCI, V3, P85
[10]  
Caferra R., 2000, LNAI, V2061