Geometry theorem proving using hilbert's nullstellensatz

Proceedings of the 5th ACM Symposium on Symbolic and Algebraic Computation, SYMSAC 1986

Volumn , Issue , 1986, Pages 202-208

  Kapur, Deepak ^a  

^a GENERAL ELECTRIC COMPANY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85034829550     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/32439.32479     Document Type: Conference Paper

References (30)

1. Agnarsson, S., Kandri-Rody, A., Kapur, D., Narendran, P., and Saunders, B. D., "Complexity of Testing whether a Polynomial Ideal is Non-trivial," Proc. of the I984 MACSYMA Users' Con)?, Schenectady, NY, pp. 452-458, July 1984.
2. Arnon, D.S., Collins, G.E., and McCallum, SC, "Cylindencal Algebraic Decomposition I: the Basic Algorithm," SIAM .I. of Computing, Vol. 13 No. 4, pp. 865-877, Nov. 1984.
3. Arnon, D.S., Collins, G.E., and McCallum, S., "Cvlinderical Algebraic Decomoosition II: An Adiacencv Algorithm for thz Plane," SI& J. of Computing, vol. 13 No. 4, pp. 878-889, Nov. 1984.
4. Ben-Or, M., Kozen, D., Reif, J.,"The Complexity of Elementary Algebra and Geometry," Proc. I6th ACM Symp. on Theory of Computing, May 1984, pp. 457-464.
5. Buchberger, B., An Algorithm for Finding a Basis for the Residue Class Ring of a Zero-Dimensional Polynomial Ideal. i&tF Inst 1985. erman) Ph D. Thesis, Univ. of Innsbruck, Austria
6. B;'chbejier, B., "An Algorithmic Criterion for the Solvability of an Algebraic System of Equations," Aequations Mathematical 413, pp. 374-383, 1970.
7. Buchberger, F., "A Criterion for Detecting Unnecessary Reductions in the Construction of Groebner bases," Proc. EVROSAM 79, Marseille, June 1979, (W. Ng. ed), LNCS 72, pp. 3-21, 1979.
8. Buchberger, B., "Gr'dbner Bases: An Algorithmic Method in Polynomial Ideal Theory," in Multidimensional Systems Z+heory (ed.N.K.Bose), Reidel, pp. 184-232, 1985.
9. Chou, S.-C., "Proving Elementry Geometry Theorems Using Wu's Algorithm," Theorem Proving: After 25 years (eds. Bledsoe & Loveland). Contemporary Mathematics Vol. 29, pp. 243-286, 1984.
10. Chou, S.-C., Proving and Discovering Theorems in Elementary Geometry using Wu's Method. Ph.D. Thesis, Dept. of Mathematics, University of Texas, Austin, 1985.
11. Chou, S.-C. and Schelter, W. F., "Proving Geometry Theorems with Rewrite Rules." Unoublished Manuscriot, University of Texas, Austin, 'Dec. 1985.
12. Collins, G.E., "Quantifier Elimination for Real Closed Fields by Cylinderic Algebraic Decomposition," Proc. 2nd GI Conf. on Automata Theory and Formal Languages, Springer-Verlag, LNCS 35, Berlin, pp. 134-183, 1975.
13. Gelernter, H.,"Realization of a Geometry Theorem Proving Machine," in Computers and Thought (eds. Feigenbaurn & Feldman), pp.134-152, McGraw Hill, 1963.
14. Gilmore, P.C.,"An Examination of the Geometry Theorem Proving Machine," Artz@cial Intelligence Vol. 1, pp. 171-187, 1970.
15. Hermann, G., "Die Frage der endlich vielen Schritte in der Theorie der Polynomideale," Mathematische Annalen 95, 736-788, 1926.
16. Hsiang, J. "Refutational Theorem Proving using Term-Rewriting Svstems." Artificial Intelliaence. Vol. 25. No. 3, pp. 25513ob, March 19&S. " ' '
17. Kandri-Rody, A., Efictive Methods in the Theory of Polynomial Ideals. Ph.D. Thesis, Dept. of Mathematics, Rensselaer Polytechnic Institute, Troy, NY, May 1984.
18. Kandri-Rody, A., and Kapur, D., "Algorithms for Computing the Gr'dbner Bases of Polynomial Ideals over Various Euclidean Rings," Proc. of the EVROSAM, '84, Springer Verlag LNCS 174 (ed. Fitch), Cambridge, England, July 1984.
19. Kapur, D., Musser, D.R., and Narendran, P., Only Prime Superpositions need be considered for the Km&h-Bendix Completion Procedure. Unpublished Manuscript, General Electric R&D Center, Schenectady, NY, December 1984.
20. Kapur, D., and Narendran, P., "An Equational Approach to Theorem Proving in First-Order Predicate Calculus," 9th International Joint Conference on Artificial Intelligence, Los Angeles, Calif., August 1985.
21. Kapur, D., Geometry Theorem Proving Using Hilbert's Nullstellensatz. Unpublished Manuscript, General Electric R&D Center, Schenectady, NY, May 1986. (An expanded version of this paper.)
22. Kutzler, B., Stifter, S., "On the Application of Buchberger's Algorithm to Automated Geometry Theorem Proving," to appear in Journal of Symbolic Computation.
23. Monk, L.G., Elementary-Recursive Decision Procedures, Ph.D. Thesis, Dept. of Mathematics, University of California, Berkeley, 1975.
24. Pohst, M. E., and Yun, D. Y. Y., "On Solving Systems of Algebraic Equations via Ideal Bases and Eliinination Theory," Proc. 1981 ACM Symp. on Symbolic and Algebraic Computation, pp. 206-211, 198 1.
25. Seidenberg, A., "A New Decision Method for Elementary Algebra," Annals of Mathematics, Vol. 60 No. 2, pp. 365-374, Sept. 1954.
26. Tarski, A., A Decision Method for Elementray Algebra and Geometry. U. of Calif. Press, 1948; 2nd edition, 19.51.
27. van der Waerden, B.L, Modern Algebra, Vol. I and II, Fredrick Ungar Publishing Co., New York, 1966
28. Wu, W., "On the Decision Problem and the Mechanization of Theorem Proving in Elementary Geometry," Scientia Sinica 21, pp. 150-172, 1978. Also in llteorem Proving: After 25 years (eds. Bledsoe & Loveland). Contemporary Mathematics Vol. 29, pp. 213-234, 1984.
29. Wu, W., "Some Recent Advances in Mechanical Theorem Proving of Geometries," in l%eorem Proving: Afer 25 years (eds. Bledsoe & Loveland). Contemporary Mathematics Vol. 29, pp. 235-241, 1984.
30. wu, w., "Basic Principles of Mechanical Theorem Proving in Geometries," J. of System Sciences and Mathematical Sciences, Vol. 4 No. 3. pp. 207-23, 1984.