Automatic discovery of geometry theorems using minimal canonical comprehensive Gröbner systems

  • Authors:

  • Antonio Montes;Tomás Recio

  • Affiliations:

  • Dep. Matemàtica Aplicada 2, Universitat Politècnica de Catalunya, Spain;Dep. Matemáticas, Estadística y Computación, Universidad de Cantabria, Spain

  • Venue:
  • ADG'06 Proceedings of the 6th international conference on Automated deduction in geometry
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The main proposal in this paper is the merging of two techniques that have been recently developed. On the one hand, we consider a new approach for computing some specializable Gröbner basis, the so called Minimal Canonical Comprehensive Gröbner Systems (MCCGS) that is -roughly speaking- a computational procedure 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 is related to automatic theorem discovery in elementary geometry. Automatic discovery aims to obtain complementary (equality and inequality type) 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.