Abstract
This paper presents the design and implementation of a geometric-object-oriented language Gool for constructing, representing, manipulating, and visualizing symbolic geometric objects and relations and performing symbolic geometric computation and formal reasoning. The language uses case distinction to formalize symbolic geometric objects and relations, reducing the problem of dealing with uncertainty and degeneracy to that of handling geometric constraints. We describe the capabilities, features, and main components of Gool, propose several techniques for geometric constraint handling, and discuss some of the implementation issues.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Hilbert D. Grundlagen der Geometrie. Teubner, Stuttgart, 1899
Wu W-t. Mechanical Theorem Proving in Geometries: Basic Principles (translated from the Chinese version by Jin X, Wang D). Springer-Verlag, Wien New York, 1994
Chou S-C, Gao X-S, Liu Z, et al. Geometric theorem provers and algebraic equation solvers. In: Gao X-S, Wang D, eds. Mathematics Mechanization and Applications, Academic Press, London, 2000, 491–505
Liang T, Wang D. Towards a geometric-object-oriented language. In: Hong H, Wang D, eds. Automated Deduction in Geometry, LNAI 3763, Springer-Verlag, Berlin Heidelberg, 2006, 130–155
Joan-Arinyo R, Hoffmann C M. A brief on constraint solving. http://www.cs.purdue.edu/homes/cmh/distribution/papers/Constraints/ThailandFull.pdf, 2005
Wang D. GEOTHER 1.1: Handling and proving geometric theorems automatically. In: Winkler F, ed. Automated Deduction in Geometry, LNAI 2930, Springer-Verlag, Berlin Heidelberg, 2004, 194–215
Kapur D. Using Gröbner bases to reason about geometry problems. J. Symb. Comput., 1986, 2: 399–408
Kutzler B, Stifter S. On the application of Buchberger’s algorithm to automated geometry theorem proving. J. Symb. Comput., 1986, 2: 389–397
Wang D. Elimination procedures for mechanical theorem proving in geometry. Ann. Math. Artif. Intell., 1995, 13: 1–24
Chou S-C, Gao X-S, Zhang J-Z. Machine Proofs in Geometry. World Scientific, Singapore, 1994
Wang D. Elimination Practice: Software Tools and Applications. Imperial College Press, London, 2004
Collins G E, Hong H. Partial cylindrical algebraic decomposition for quantifier elimination. J. Symb. Comput., 1991, 12: 299–328
Yang L, Hou X-R, Xia B. A complete algorithm for automated discovering of a class of inequality-type theorems. Sci. China (Ser. F), 2001, 44: 33–49
Dolzmann A, Sturm T. Simplification of quantifier-free formulae over ordered fields. J. Symb. Comput., 1997, 24: 209–231
Zeng G, Zeng X. An effective decision method for semidefinite polynomials. J. Symb. Comput., 2004, 37: 83–99
Brown C W, Hong H. QEPCAD — Quantifier elimination by partial cylindrical algebraic decomposition. http://www.cs.usna.edu/:_qepcad/B/QEPCAD.html, 2004
Chen X, Wang D. Towards an electronic geometry textbook. In: Botana F, Roanes-Lozano E, eds. Automated Deduction in Geometry, Universidad de Vigo, Pontevedra, Spain, 2006, 15–25
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Liang, T., Wang, D. On the design and implementation of a geometric-object-oriented language. Front. Comput. Sc. China 1, 180–190 (2007). https://doi.org/10.1007/s11704-007-0018-z
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s11704-007-0018-z