A New Approach for Automatic Theorem Proving in Real Geometry
We present a new method for proving geometric theorems in the real plane or higher dimension. The method is derived from elimination set ideas for quantifier elimination in linear and quadratic formulas over the reals. In contrast to other approaches, our method can also prove theorems whose complex...
Gespeichert in:
Veröffentlicht in: | Journal of automated reasoning 1998, Vol.21 (3), p.357 |
---|---|
Hauptverfasser: | , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | We present a new method for proving geometric theorems in the real plane or higher dimension. The method is derived from elimination set ideas for quantifier elimination in linear and quadratic formulas over the reals. In contrast to other approaches, our method can also prove theorems whose complex analogues fail. Moreover, the problem formulation may involve order inequalities. After specification of independent variables, nondegeneracy conditions are generated automatically. Moreover, when trying to prove conjectures that - apart from nondegeneracy conditions - do not hold in the claimed generality, missing premises are found automatically. We demonstrate the applicability of our method to nontrivial examples.[PUBLICATION ABSTRACT] |
---|---|
ISSN: | 0168-7433 1573-0670 |
DOI: | 10.1023/A:1006031329384 |