Combining algebraic computing and term-Rewriting for geometry theorem proving

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

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 Carol. The experiments together with several examples illustrate the suitability and performance of our approach.

Original languageEnglish
Title of host publicationArtificial Intelligence and Symbolic Computation - International Conference AISC 1998, Proceedings
EditorsJacques Calmet, Jan Plaza
PublisherSpringer Verlag
Pages145-156
Number of pages12
ISBN (Print)3540649603, 9783540649601
DOIs
StatePublished - 1998
Externally publishedYes
Event4th International Conference on Artificial Intelligence and Symbolic Computation, AISC 1998 - Plattsburgh, United States
Duration: 16 Sep 199818 Sep 1998

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1476
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference4th International Conference on Artificial Intelligence and Symbolic Computation, AISC 1998
Country/TerritoryUnited States
CityPlattsburgh
Period16/09/9818/09/98

Fingerprint

Dive into the research topics of 'Combining algebraic computing and term-Rewriting for geometry theorem proving'. Together they form a unique fingerprint.

Cite this