Combining Clifford algebraic computing and term-rewriting for geometric theorem proving

A general approach we have proposed for automatically proving geometric theorems requires both Clifford algebraic reduction and term-rewriting. This paper shows how efficient techniques and software tools developed in the areas of algebraic computation and term-rewriting can be combined for our purpose of theorem proving in geometry. Some investigations and experiments for 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.