A generalized Euclidean algorithm for geometry theorem proving
From MaRDI portal
Publication:1924743
DOI10.1007/BF01531324zbMath0855.68093MaRDI QIDQ1924743
Publication date: 24 November 1996
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Related Items
Cites Work
- On the dimension of an arbitrary ascending chain
- On the application of Buchberger's algorithm to automated geometry theorem proving
- Proving geometry theorems with rewrite rules
- Geometry theorem proving by decomposition of quasi-algebraic sets: An application of the Ritt-Wu principle
- A refutational approach to geometry theorem proving
- The membership problem for unmixed polynomial ideals is solvable in single exponential time
- A new method for solving algebraic systems of positive dimension
- Solving zero-dimensional algebraic systems
- A generalized Euclidean algorithm for computing triangular representations of algebraic varieties
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: A generalized Euclidean algorithm for geometry theorem proving