Plane Euclidean reasoning

被引:0
|
作者
Fearnley-Sander, D [1 ]
机构
[1] Univ Tasmania, Dept Math, Hobart, Tas 7001, Australia
来源
AUTOMATED DEDUCTION IN GEOMETRY, PROCEEDINGS | 1999年 / 1669卷
关键词
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
An automatic reasoning system for plane Euclidean geometry should handle the wide variety of geometric concepts: points, vectors, angles, triangles, rectangles, circles, lines, parallelism, perpendicularity, area, orientation, inside and outside, similitudes, isometries, sine, cosine,... . It should be able to construct and transform geometric objects, to compute geometric quantities and to prove geometric theorems. It should be able to call upon geometric knowledge transparently when it is needed. In this paper a type of ring generated by points and numbers is presented which may provide a formal basis for reasoning systems that meet these requirements. The claim is that this simple algebraic structure embodies all the concepts and properties that are investigated in the many different theories of the Euclidean plane.
引用
收藏
页码:86 / 110
页数:25
相关论文
共 50 条