Abstract
We report our effort to build a geometry deductive database, which can be used to find the fixpoint for a geometric configuration. The system can find all the properties of the configuration that can be deduced using a fixed set of geometric rules. To control the size of the database, we propose the idea of a structured deductive database. Our experiments show that this technique could reduce the size of the database by one hundred times. We propose the data-based search strategy to improve the efficiency of forward chaining. We also make clear progress in the problems of how to select good geometric rules, how to add auxiliary points, and how to construct numerical diagrams as models automatically. The program is tested with 160 nontrivial geometry configurations. For these geometric configurations, the program not only finds most of their well-known properties but also often gives unexpected results, some of which are possibly new. Also, the proofs generated by the program are generally short and totally geometric.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bancilhon, F. and Ramakrishnan, R.: An amateur's introduction to recursive query processing strategies, in C. Zanioilo (ed.), Proc. of ACM SIGMOD Conference, 1986, pp. 16-52.
Buntine, W.: Generalized subsumption and its application to induction and redundancy, Artif. Intell. 36(2) (1988), 149-179.
Chou, S. C.: Mechanical Geometry Theorem Proving, D. Reidel Publishing Company, Dordrecht, Netherlands, 1988.
Chou, S. C. and Gao, X. S.: Mechanical formula derivation in elementary geometries, in Proc. ISSAC-90, ACM, New York, 1990, pp. 265-270.
Chou, S. C., Gao, X. S. and Zhang, J. Z.: Machine Proofs in Geometry, World Scientific, 1994.
Chou, S. C., Gao, X. S. and Zhang, J. Z.: Automated generation of readable proofs with geometric invariants, I: Multiple and shortest proof generation, J. Automated Reasoning 17(3) (1996), 325-347.
Chou, S. C., Gao, X. S. and Zhang, J. Z.: Automated generation of readable proofs with geometric invariants, II: Proving theorems with full-angles, WSUCS-94-3, CS Dept, Wichita State University, March 1994, J. Automated Reasoning 17(3) (1996), 349-370.
Coelho, H. and Pereira, L.M.: Automated reasoning in geometry theorem proving with prolog, J. Automated Reasoning 2 (1986), 329-390.
Bulmer, M. and Fearnley-Sander, D.: The kinds of truth of geometry theorems, Preprint.
Gallaire, H., Minker, J. and Nicola, J. M.: Logic and databases: A deductive approach, ACM Comput. Surveys 16(2) (1984), 153-185.
Gerlentner, H., Hanson, J. R. and Loveland, D. W.: Empirical explorations of the geometry-theorem proving machine, in Proc. West. Joint Computer Conf., 1960, pp. 143-147.
Havel, T.: The use of distance as coordinates in computer-aided proofs of theorems in Euclidean geometry, IMA Preprint, No. 389, University of Minnesota, 1988.
Helm, R.: On the elimination of redundant derivations during execution, in Proc. of 1990 North American Conference on Logic Programming, The MIT Press, 1990, pp. 551-568.
Kapur, D.: Geometry theorem proving using Hilbert's nullstellensatz, in Proc. SYMSAC'86, Waterloo, 1986, pp. 202-208.
Koedinger, K. R. and Anderson, J. R.: Abstract planning and perceptual chunks: Elements of expertise in geometry, Cognitive Science 14 (1990), 511-550.
Hong-Bo, Li and Minteh, Cheng: Clifford algebraic reduction method for automated theorem proving in differential geometry, J. Automated Reasoning 21(1) (1998), 1-21.
Nevins, A. J.: Plane geometry theorem proving using forward chaining, Artif. Intell. 6 (1975), 1-23. 18._ Recio, T. and Velex-Melon, M. P.: Automatic discovery of theorems in elementary geometry, Preprint, 1997.
Reiter, R.: A semantically guided deductive system for automatic theorem proving, IEEE Trans. on Computers C-25(4) (1976), 328-334.
Reiter, R.: On the closed world data bases, in H. Gallaire and J. Minker (eds), Logic and Data Bases, Plenum Press, New York, 1978, pp. 55-76.
Robinson, A.: Proving a theorem (as done by Man, Logician, or Machine), in J. Siekmann and G. Wrightson (eds), Automation of Reasoning, Springer-Verlag, 1983, pp. 74-78.
Sagiv, Y.: Optimizing datalog programs, in J. Minker (ed.), Foundations of Deductive Databases and Logic Programming, Morgan Kauffmann, 1988, pp. 659-698.
Wang, D. M.: Reasoning about geometric problems using an elimination method, in J. Pfalzgraf and D. M. Wang (eds), Automated Practical Reasoning, Springer-Verlag, 1995, pp. 148-185.
White, N. L. and Mcmillan, T.: Cayley factorization, in Proc. ISSAC'88, ACM Press, 1988, pp. 4-8.
Wos, L.: Automated Reasoning: 33 Basic Research Problems, Prentice-Hall, Englewood Cliffs, New Jersey, 1988.
Wu Wen-tsün: Basic Principles of Mechanical Theorem Proving in Geometries, Volume I: Part of Elementary Geometries, Science Press, Beijing (in Chinese), 1984. English version, Springer-Verlag, 1993.
Rights and permissions
About this article
Cite this article
Chou, SC., Gao, XS. & Zhang, JZ. A Deductive Database Approach to Automated Geometry Theorem Proving and Discovering. Journal of Automated Reasoning 25, 219–246 (2000). https://doi.org/10.1023/A:1006171315513
Issue Date:
DOI: https://doi.org/10.1023/A:1006171315513