Geometry theorem proving by decomposing polynomial system into strong regular sets

This paper presents a complete method to prove geometric theorem by decomposing the corresponding polynomial system into strong regular sets, by which one can compute some components for which the geometry theorem is true and exclude other components for which the geometry theorem is false. Two exam...

Full description

Saved in:
Bibliographic Details
Published inJournal of computer science and technology Vol. 19; no. 6; pp. 820 - 827
Main Authors Li, Yong-Bin, Liu, Wu, Xiang, Xiao-Lin
Format Journal Article
LanguageEnglish
Published Beijing Springer Nature B.V 01.12.2004
Mathematical College, Sichuan University, Chengdu 610041, P.R. China
College of Information Technology, Sichuan Normal University, Chengdu 610068, P.R.China%Department of Computer Science and Technology, Sichuan Agriculture University,Dujiangyan 611830 P.R. China%Mathematical College, Sichuan University, Chengdu 610041, P.R. China
Subjects
Decomposition
Geometry
Polynomials
Theorem proving
Theorems
subsidiary condition
strong regular set
zero decomposition
automated geometry theorem proving
Online AccessGet full text

Cover

More Information
Summary:This paper presents a complete method to prove geometric theorem by decomposing the corresponding polynomial system into strong regular sets, by which one can compute some components for which the geometry theorem is true and exclude other components for which the geometry theorem is false. Two examples are given to show that the geometry theorems are conditionally true for some components which are excluded by other methods.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:1000-9000
1860-4749
DOI:10.1007/BF02973445