A procedure to prove geometrical statements
- 1 January 1989
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 141-150
- https://doi.org/10.1007/3-540-51082-6_74
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Some effectivity problems in polynomial ideal theoryPublished by Springer Nature ,2005
- Mechanization theorems of various geometriesPublished by Springer Nature ,1994
- Using Gröbner bases to reason about geometry problemsJournal of Symbolic Computation, 1986
- On the application of Buchberger's algorithm to automated geometry theorem provingJournal of Symbolic Computation, 1986
- Proving geometry theorems with rewrite rulesJournal of Automated Reasoning, 1986
- Some algorithmic questions on ideals of differential operatorsLecture Notes in Computer Science, 1985
- A note on the complexity of constructing standard basesLecture Notes in Computer Science, 1985
- Proving Elementary Geometry Theorems Using Wu’s AlgorithmPublished by American Mathematical Society (AMS) ,1984
- Definability and fast quantifier elimination in algebraically closed fieldsTheoretical Computer Science, 1983
- A propos du théorème de préparation de weierstrassPublished by Springer Nature ,1974