ELIMINATION PROCEDURES FOR MECHANICAL THEOREM-PROVING IN GEOMETRY

被引:28
|
作者
WANG, DM [1 ]
机构
[1] JOHANNES KEPLER UNIV,SYMBOL COMPUTAT RES INST,A-4040 LINZ,AUSTRIA
关键词
D O I
10.1007/BF01531321
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, methods for the algebraic decision problem of mechanical theorem proving in elementary geometry are described on the basis of some elimination procedures for polynomial systems. The methods can determine whether or not a geometric theorem is generically true and whether it is true or false for each of the components including degenerate ones, with projection and irreducible decomposition. Theorems which have been proved using an implementation of the methods in Maple include the Simson Theorem, Butterfly Theorem, Secant Theorem, Feuerbach Theorem, Steiner Theorem, Steiner-Lehmus Theorem, Merely Theorem and Thebault-Taylor Theorem, of which some are taken as illustrative examples in the paper.
引用
收藏
页码:1 / 24
页数:24
相关论文
共 50 条