Generic Hermitian Quantifier Elimination

We present a new method for generic quantifier elimination that uses an extension of Hermitian quantifier elimination. By means of sample computations we show that this generic Hermitian quantifier elimination is, for instance, an important method for automated theorem proving in geometry.

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Dolzmann, Andreas, Gilch, Lorenz A.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Artificial intelligence Atomic Formula Computer Algebra System Computer science control theory systems Exact sciences and technology Learning and adaptive systems Real Zero Symbolic Computation Theorem Prove Theoretical computing
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	We present a new method for generic quantifier elimination that uses an extension of Hermitian quantifier elimination. By means of sample computations we show that this generic Hermitian quantifier elimination is, for instance, an important method for automated theorem proving in geometry.
ISSN:	0302-9743 1611-3349
DOI:	10.1007/978-3-540-30210-0_8