Abstract
In this paper we combine the Schwartz-Zippel theorem with statistical inference theory and develop a new probabilistic algorithm instead of deterministic algorithms for geometry theorem proving. Our work includes an improved algorithm for estimating the upper bounds in the pseudo-remainder, and three selection criteria for statistical populations.
This work is supported by the Project 11471209 of the National Natural Science Foundation of China.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Chou, S.C.: Proving elementary geometry theorem using Wu’s Algorithm. Department of Mathematics, University of Texas at Austin, Ph.D. thesis (1985)
Wu, W.T.: Basic principles of mechanical theorem proving in elementary geometries. J. Symb. Comput. 2(4), 221–25 (1986)
Kapur, D.: Using Grobner bases to reason about geometry problems. J. Symb. Comput. 2, 399–408 (1986)
Kutzler, B., Stifter, S.: Automated geometry theorem proving using Buchberger’s algorithm. In: On Symbolic and Algebraic Computation, pp. 209–214. ACM Press (1986)
Kapur, D., Saxena, T., Yang, L.: Algebraic and geometric reasoning using Dixon resultant. In: Proceedings of ISSAC 1994, vol. 7, pp. 97–107 (1994)
Hong, J.W.: Can we prove geometry theorem by computing an example? Sci. China Math. (Ser. A) 16(3), 234–243 (1986)
Zhang, J.Z., Yang, L., Deng, M.K.: The parallel numerival methods in mechanical theorem proving. Theoret. Comput. Sci. 74, 253–271 (1990)
Bellman, R.E.: On Proving Theorems in Plane Geometry via Digital Computer. RAND Corporation, Santa Monica (1965)
Schwartz, J.T.: Fast probabilistic algorithms for verification of polynomical identities. J. ACM 27, 701–717 (1980)
Carrá Ferro, G., Gallo, G., Gennaro, R.: Probabilistic verification of elementary geometry statements. In: Wang, D. (ed.) ADG 1996. LNCS, vol. 1360, pp. 87–101. Springer, Heidelberg (1997). https://doi.org/10.1007/BFb0022721
Brownawell, W.D.: Bounds for the degrees in the Nullstellensatz. Ann. Math. 126, 577–591 (1987)
Kollar, J.: Sharp effective Nullstellensatz. J. Am. Math. Soc. 1, 963–975 (1988)
Gallo, G., Mishra, B.: Efficient algorithm and bounds for Wu-Ritt characteristic sets. In: Mora, T., Traverso, C. (eds.) Effective Methods in Algebraic Geometry. Progress in Mathematics, vol. 94, pp. 119–142. Birkhauser, Boston (1990). https://doi.org/10.1007/978-1-4612-0441-1_8
Gallo, G., Mishra, B.: Wu-Ritt characteristic sets and their complexity. DIMACS Ser. 6, 111–136 (1991)
Tulone, D., Yap, C., Li, C.: Randomized xero testing of radical expressions and elementary geometry theorem proving. In: Richter-Gebert, J., Wang, D. (eds.) ADG 2000. LNCS (LNAI), vol. 2061, pp. 58–82. Springer, Heidelberg (2001). https://doi.org/10.1007/3-540-45410-1_5
Tulone, D., Yap, C., Li, C.: Core Library. http://cs.nye.edu/exact/cpre/
Wang, D.M.: EPSILON. http://www-calfor.lip6.fr/wang/epsilon/
Chou, S.C.: An introduction to Wu’s method for mechanical theorem proving in geometry. J. Autom. Reason. 4, 237–267 (1988)
Wang, D.M.: A new theorem discovered by computer prover. J. Geom. 36, 173–182 (1989)
Gao, X.-S., Lin, Q.: MMP/Geometer – a software package for automated geometric reasoning. In: Winkler, F. (ed.) ADG 2002. LNCS (LNAI), vol. 2930, pp. 44–66. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-24616-9_4
Deng, M.K.: The parallel numerical method of proving the construction geometric theorem. Chin. Sci. 34, 1066–1070 (1989)
Yang, L., Zhang, J.Z., Li, C.Z.: A prover for papallel numerical verification to a class of constructive geometirc theorem. J. Guangzhou Univ. (Nat. Sci. Ed.) 1(3), 29–34 (2002)
Casella, G., Berger, R.L.: Statistical Inference, 2nd edn. Duxbury Press, Duxbury (2001)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Chen, M., Zeng, Z. (2019). A Probabilistic Algorithm for Verification of Geometric Theorems. In: Du, DZ., Li, L., Sun, X., Zhang, J. (eds) Algorithmic Aspects in Information and Management. AAIM 2019. Lecture Notes in Computer Science(), vol 11640. Springer, Cham. https://doi.org/10.1007/978-3-030-27195-4_3
Download citation
DOI: https://doi.org/10.1007/978-3-030-27195-4_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-27194-7
Online ISBN: 978-3-030-27195-4
eBook Packages: Computer ScienceComputer Science (R0)