Advertisement

Combining algebraic computing and term-rewriting for geometry theorem proving

  • Stéphane Fèvre
  • Dongming Wang
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1476)

Abstract

This note reports some of our investigations on combining algebraic computing and term-rewriting techniques for automated geometry theorem proving. A general approach is proposed that requires both Clifford algebraic reduction and term-rewriting. Preliminary experiments for some concrete cases have been carried out by combining routines implemented in Maple V and Objective Caml. The experiments together with several examples illustrate the suitability and performance of our approach.

Keywords

Theorem Prove Clifford Algebra Computer Algebra System Algebraic Computation Geometric Theorem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Buchberger, B.: Gröbner bases: An algorithmic method in polynomial ideal theory. In: Multidimensional systems theory (N. K. Bose, ed.), D. Reidel, Dordrecht Boston, pp. 184–232 (1985).Google Scholar
  2. 2.
    Bündgen, R.: Combining computer algebra and rule based reasoning. In: Proc. AISMC-2 (Cambridge, UK, August 3–5, 1994), LNCS 958, pp. 209–223 (1995).Google Scholar
  3. 3.
    Fèvre, S.: Integration of reasoning and algebraic calculus in geometry. In: Automated deduction in geometry (D. Wang et al., eds.), LNAI 1360, pp. 218–234 (1998).Google Scholar
  4. 4.
    Fèvre, S., Wang, D.: Proving geometric theorems using Clifford algebra and rewrite rules. In: Proc. CADE-15 (Lindau, Germany, July 5–10, 1998), LNAI (to appear).Google Scholar
  5. 5.
    Hestenes, D., Sobczyk, G.: Clifford algebra to geometric calculus. D. Reidel, Dordrecht Boston (1984).Google Scholar
  6. 6.
    Homann, K., Calmet, J.: Combining theorem proving and symbolic mathematical computing. In: Proc. AISMC-2 (Cambridge, UK, August 3–5, 1994), LNCS 958, pp. 18–29 (1995).Google Scholar
  7. 7.
    Li, H.: New explorations on mechanical theorem proving of geometries. Ph.D thesis, Beijing University, China (1994).Google Scholar
  8. 8.
    Li, H.: Vectorial equations-solving for mechanical geometry theorem proving. J. Automat. Reason. (to appear).Google Scholar
  9. 9.
    Li, H., Cheng, M.-t.: Proving theorems in elementary geometry with Clifford algebraic method. Chinese Math. Progress 26: 357–371 (1997).zbMATHMathSciNetGoogle Scholar
  10. 10.
    Marché, C.: Normalized rewriting: An alternative to rewriting modulo a set of equations. J. Symb. Comput. 3: 253–288 (1996).zbMATHCrossRefGoogle Scholar
  11. 11.
    Wang, D.: GEOTHER: A geometry theorem prover. In: Proc. CADE-13 (New Brunswick, USA, July 30–August 3, 1996), LNAI 1104, pp. 166–170 (1996).Google Scholar
  12. 12.
    Wang, D.: Clifford algebraic calculus for geometric reasoning with application to computer vision. In: Automated deduction in geometry (D. Wang et al., eds.), LNAI 1360, pp. 115–140 (1998).Google Scholar
  13. 13.
    Wu, W.-t.: Mechanical theorem proving in geometries: Basic principles. Springer, Wien New York (1994).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Stéphane Fèvre
    • 1
  • Dongming Wang
    • 1
  1. 1.Laboratoire LEIBNIZInstitut IMAGGrenoble CedexFrance

Personalised recommendations