Supporting proving and discovering geometric inequalities in GeoGebra by using Tarski
From MaRDI portal
Publication:6653970
DOI10.4204/eptcs.352.18MaRDI QIDQ6653970
Zoltán Kovács, Christopher W. Brown, Robert Vajda
Publication date: 17 December 2024
Symbolic computation and algebraic computation (68W30) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Real quantifier elimination is doubly exponential
- Partial cylindrical algebraic decomposition for quantifier elimination
- A deductive database approach to automated geometry theorem proving and discovering
- Polynomial constraints and unsat cores in \textsc{Tarski}
- Automatic discovery of theorems in elementary geometry
- Automated detection of interesting properties in regular polygons
- A review and prospect of readable machine proofs for geometry theorems
- Rewriting input expressions in complex algebraic geometry provers
- Giac and GeoGebra – Improved Gröbner Basis Computations
- SyNRAC: A Toolbox for Solving Real Algebraic Constraints
- An Introduction to Java Geometry Expert
- The Relation Tool in GeoGebra 5
- Implementation of a geometry theorem proving package in SCRATCHPAD II
- Automated Deduction in Geometry
- Quantifier elimination by cylindrical algebraic decomposition based on regular chains
This page was built for publication: Supporting proving and discovering geometric inequalities in GeoGebra by using Tarski
