中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
Algebraic representation, elimination and expansion in automated geometric theorem proving

文献类型:期刊论文

作者Li, HB
刊名AUTOMATED DEDUCTION IN GEOMETRY
出版日期2004
卷号2930页码:106-123
关键词Cayley algebra bracket algebra automated theorem proving projective geometry affine geometry conics
ISSN号0302-9743
英文摘要Cayley algebra and bracket algebra are important approaches to invariant computing in projective and affine geometries, but there are some difficulties in doing algebraic computation. In this paper we show how the principle "breefs" - bracket-oriented representation, elimination and expansion for factored and shortest results, can significantly simplify algebraic computations. We present several typical examples on automated theorem proving in conics and make detailed discussions on the procedure of applying the principle to automated geometric theorem proving.
语种英语
WOS记录号WOS:000189423200007
出版者SPRINGER-VERLAG BERLIN
源URL[http://ir.amss.ac.cn/handle/2S8OKBNM/19139]  
专题系统科学研究所
通讯作者Li, HB
作者单位Chinese Acad Sci, Acad Math & Syst Sci, Math Mech Key Lab, Beijing 100080, Peoples R China
推荐引用方式
GB/T 7714
Li, HB. Algebraic representation, elimination and expansion in automated geometric theorem proving[J]. AUTOMATED DEDUCTION IN GEOMETRY,2004,2930:106-123.
APA Li, HB.(2004).Algebraic representation, elimination and expansion in automated geometric theorem proving.AUTOMATED DEDUCTION IN GEOMETRY,2930,106-123.
MLA Li, HB."Algebraic representation, elimination and expansion in automated geometric theorem proving".AUTOMATED DEDUCTION IN GEOMETRY 2930(2004):106-123.

入库方式: OAI收割

来源:数学与系统科学研究院

浏览0
下载0
收藏0
其他版本

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。