MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  Randomized zero testing of radical expressions and elementary geometry theorem proving (2000) [7 citations — 4 self]

Download:
Download as a PDF | Download as a PS
by Daniela Tulone, Chee Yap, Chen Li
In Proceedings of the Third International Workshop on Automated Deduction in Geometry (ADG 2000
http://cs.nyu.edu/chenli/papers/prover_adg00.ps
Add To MetaCart

Abstract:

We develop a probabilistic test for the vanishing of radical expressions, that is, expressions involving the four rational operations (+;; ; ) and square root extraction. This extends the well-known Schwartz's probabilistic test for the vanishing of polynomials. The probabilistic test forms the basis of a new theorem prover for conjectures about ruler & compass constructions. Our implementation uses the Core Library which can perform exact comparison for radical expressions. Some experimental results are presented. 1

Citations

86 The complexity of the word problems for commutative semigroups and polynomial ideals – Mayr, Meyer - 1982
80 Effective Polynomial Computation – Zippel - 1993
60 Basic principles of mechanical theorem proving in geometries, Volume I – Wu - 1995
54 Robust geometric computation – Yap - 2004
38 A core library for robust numeric and geometric computation – Karamcheti, Li, et al. - 1999
27 Efficient algorithms and bounds for Wu-Ritt characteristic sets – Gallo, Mishra - 1990
24 On the decision problem and the mechanization of theorem proving in elementary geometry – Wu - 1978
21 A new constructive root bound for algebraic expressions – Li, Yap - 2001
19 Towards exact geometric computation. Computational Geometry: Theory and Applications – Yap - 1997
12 Real/Expr: Implementation of an exact computation package – Ouchi - 1997
10 Proving by example and gap theorem – Hong - 1986
10 A new lower bound construction for commutative Thue systems with applications – Yap - 1991
9 Automated geometry theorem proving using Buchberger's algorithm – Kutzler, Stifter - 1986
8 Proving elementary geometry theorems using Wu's algorithm – Chou - 1984
8 Some recent advances in mechanical theorem proving of geometries – Wu - 1984
7 Using Grobner Bases to Reason About Geometry Problems – Kapur - 1986
6 Wu-Ritt Characteristic Sets and Their Complexity – Gallo, Mishra - 1991
5 A generalized and improved constructive separation bound for real algebraic expressions – Mehlhorn, Schirra - 2000
4 A procedure to prove geometrical statements – a, Gallo - 1986
4 Proving geometry theorems using Wu's Method: A collection of geometry theorems proved mechanically – Chou - 1986
4 Exact Geometric Computation: Theory and Applications – Li - 2001
3 La Dimostrazione Automatica in Geometria e Questioni di Complessita' Correlate. Tesi di dottorato – Gallo - 1989
3 Using Groebner bases to reason about geometry problems – Kapur - 1986
1 Probabilistic veri of elementary geometry statements – Ferro, Gallo, et al. - 1997
1 Mechanical Geomtry Theorem Proving – Chou - 1988
1 and G.Gallo. Automatic theorem proving in elementary geometry – Ferro - 1988
1 Probabilistic veri of polynomial identities – Schwartz - 1980
1 Proving real geometry theorems and the computation of the real radical – Conti, Traverso - 2000
1 characteristic sets and their complexity – Wu-Ritt - 1991