Automatic Discovery of Geometry Theorems Using Minimal Canonical Comprehensive Gröbner Systems
From MaRDI portal
Abstract: The main idea in this paper is merging two techniques that have been recently developed. On the one hand, we consider MCCGS, standing for Minimal Canonical Comprehensive Groebner Systems, a recently introduced computational tool yielding "good" bases for ideals of polynomials over a field depending on several parameters, that specialize "well", for instance, regarding the number of solutions for the given ideal, for different values of the parameters. The second ingredient concerns automatic theorem discovery in elementary geometry. Automatic discovery aims to obtain complementary hypotheses for a (generally false) geometric statement to become true. The paper shows how to use MCCGS for automatic discovering of theorems and gives relevant examples.
Recommendations
Cites work
- A method for the mechanical derivation of formulas in elementary geometry
- A new algorithm for discussing Gröbner bases with parameters.
- A new approach for automatic theorem proving in real geometry
- Artificial Intelligence and Symbolic Computation
- Automated Deduction in Geometry
- Automated Deduction in Geometry
- Automatic discovery of theorems in elementary geometry
- Comprehensive Gröbner bases
- Gröbner bases for families of affine or projective schemes
- scientific article; zbMATH DE number 3926285 (Why is no real title available?)
- scientific article; zbMATH DE number 41286 (Why is no real title available?)
- scientific article; zbMATH DE number 1302474 (Why is no real title available?)
- scientific article; zbMATH DE number 1163428 (Why is no real title available?)
- scientific article; zbMATH DE number 1515218 (Why is no real title available?)
- scientific article; zbMATH DE number 2151206 (Why is no real title available?)
- Improving the DISPGB algorithm using the discriminant ideal
- Minimal canonical comprehensive Gröbner systems
- On protocols for the automated discovery of theorems in elementary geometry
- Some features of \(CoCoA 3\)
- Using Gröbner bases to reason about geometry problems
- Wu's method and its application to perspective viewing
Cited in
(19)- Minimal canonical comprehensive Gröbner systems
- Automated reducible geometric theorem proving and discovery by Gröbner basis method
- A survey on algorithms for computing comprehensive Gröbner systems and comprehensive Gröbner bases
- Automatic discovery of theorems in elementary geometry
- Generalizing the Steiner-Lehmus theorem using the Gröbner cover
- Generic regular decompositions for generic zero-dimensional systems
- Automated generation of geometric theorems from images of diagrams
- Detecting truth, just on parts
- Towards the Automatic Discovery of Theorems in GeoGebra
- Automatic Calculation of Plane Loci Using Gröbner Bases and Integration into a Dynamic Geometry System
- scientific article; zbMATH DE number 1189068 (Why is no real title available?)
- Automatic deduction in (dynamic) geometry: Loci computation
- scientific article; zbMATH DE number 2203381 (Why is no real title available?)
- Cylinders Through Five Points: Complex and Real Enumerative Geometry
- Gröbner bases for polynomial systems with parameters
- Automated generation of geometry proof problems based on point geometry identity
- Completing parametric unimodular rows to unimodular matrices
- On protocols for the automated discovery of theorems in elementary geometry
- Generic regular decompositions for parametric polynomial systems
This page was built for publication: Automatic Discovery of Geometry Theorems Using Minimal Canonical Comprehensive Gröbner Systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5453488)
