Automated Deduction in Geometry

Automated discovering and proving for geometric inequalities have been considered a difficult topic in the area of automated reasoning for manyy ears. Some well-known algorithms are complete theoretically but inefficient in practice, and cannot verify non-trivial propositions in batches. In this paper, we present an efficient algorithm to discover and prove a class of inequality-type theorems automatically by combining discriminant sequence for polynomials with Wu's elimination and a partial cylindrical algebraic decomposition. Also this algorithm is applied to the classification of the real physical solutions of geometric constraint problems. Manygeom etric inequalities have been discovered by our program, DISCOVERER, which implements the algorithm in Maple.

[1]  Tomás Recio,et al.  Sturm-Habicht sequence , 1989, ISSAC '89.

[2]  S. Chou.  Mechanical Geometry Theorem Proving , 1987 .

[3]  George E. Collins,et al.  Cylindrical Algebraic Decomposition II: An Adjacency Algorithm for the Plane , 1984, SIAM J. Comput..

[4]  Bruno Buchberger,et al.  Applications of Gröbner Bases in Non-linear Computational Geometry , 1987, Trends in Computer Algebra.

[5]  Dennis S. Arnon,et al.  On the Mechanical Proof of Geometry Theorems Involving Inequalities , 1989 .

[6]  Tun Wen-Dun.  ON THE DECISION PROBLEM AND THE MECHANIZATION OF THEOREM-PROVING IN ELEMENTARY GEOMETRY , 1978 .

[7]  Bruno Buchberger,et al.  Applications of Gro¨bner bases in non-linear computational geometry , 1988 .

[8]  Lu Yang,et al.  A complete discrimination system for polynomials , 1996 .

[9]  Lu Yang,et al.  Explicit Criterion to Determine the Number of Positive Roots of a Polynomial 1) , 1997 .

[10]  Josip Pečarić,et al.  Recent advances in geometric inequalities , 1989, Acta Applicandae Mathematicae.

[11]  Wen-tsün Wu.  Numerical and Symbolic Scientific Computing , 1994, Texts & Monographs in Symbolic Computation.

[12]  George E. Collins,et al.  Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975, Automata Theory and Formal Languages.

[13]  Dennis S. Arnon,et al.  Geometric Reasoning with Logic and Algebra , 1988, Artif. Intell..

[14]  Franz Winkler,et al.  Polynomial Algorithms in Computer Algebra , 1996, Texts and Monographs in Symbolic Computation.

[15]  Deepak Kapur,et al.  Automated Geometric Reasoning: Dixon Resultants, Gröbner Bases, and Characteristic Sets , 1996, Automated Deduction in Geometry.

[16]  Lu Yang.  A Simplified Algorithm for Solution Classification of the Perspective-three-Point Problem 1) , 1998 .

[17]  Wenjun Wu,et al.  Mechanical Theorem Proving in Geometries , 1994, Texts and Monographs in Symbolic Computation.

[18]  George E. Collins,et al.  Partial Cylindrical Algebraic Decomposition for Quantifier Elimination , 1991, J. Symb. Comput..

[19]  Bruno Buchberger,et al.  Algebraic methods for geometric reasoning , 1988 .

[20]  Zhang Jing.  A Criterion for Dependency of Algebraic Equations With Applications to Automated Theorem Proving , 1994 .

[21]  杨路.  Practical Automated Reasoning on INEQUALITIES：gENERIC pROGRAMS FOR iNEQUALITY pROVING , 1998 .

[22]  Xiao Gao,et al.  A Combination of Ritt-Wu''s Method and Collins'' Method , 1989 .

[23]  A. Tarski.  A Decision Method for Elementary Algebra and Geometry , 2023 .

[24]  Xiao-Shan Gao,et al.  Automated Production of Readable Proofs for Theorems in Non-Euclidian Geometries , 1996, Automated Deduction in Geometry.

[25]  Xiao-Shan Gao,et al.  Mechanically Proving Geometry Theorems Using a Combination of Wu's Method and Collins' Method , 1994, CADE.

[26]  George E. Collins,et al.  Cylindrical Algebraic Decomposition I: The Basic Algorithm , 1984, SIAM J. Comput..

[27]  Folke Eriksson,et al.  Which Triangles Are Plane Sections of Regular Tetrahedra , 1994 .

[28]  A. Seidenberg.  A NEW DECISION METHOD FOR ELEMENTARY ALGEBRA , 1954 .

[29]  George E. Collins,et al.  Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .