Using geometric rewrite rules for solving geometric problems symbolically
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3813580 (Why is no real title available?)
- scientific article; zbMATH DE number 3497890 (Why is no real title available?)
- scientific article; zbMATH DE number 1142316 (Why is no real title available?)
- scientific article; zbMATH DE number 3299786 (Why is no real title available?)
- scientific article; zbMATH DE number 3068536 (Why is no real title available?)
- A note on syntactic symmetry and the manipulation of formal systems by machine
- A refutational approach to geometry theorem proving
- Algebraic simplification
- Automated reasoning in geometry theorem proving with Prolog
- Basic principles of mechanical theorem proving in elementary geometries
Cited in
(6)- scientific article; zbMATH DE number 194597 (Why is no real title available?)
- Solving geometry problems using a combination of symbolic and numerical reasoning
- Tolerances in geometric constraint problems
- A formalization of geometric constraint systems and their decomposition
- Proving geometry theorems with rewrite rules
- Finding the Symbolic Solution of a Geometric Problem Through Numerical Computations
This page was built for publication: Using geometric rewrite rules for solving geometric problems symbolically
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685375)