Skip to main content
Journal Article

Generic Hermitian Quantifier Elimination

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 3249 80-93
DOI: 10.1007/978-3-540-30210-0_8
10Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

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. ©Springer- Verlag 2004.

Cite

CITATION STYLE

APA

Dolzmann, A., & Gilch, L. A. (2004). Generic Hermitian Quantifier Elimination. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3249, 80–93. https://doi.org/10.1007/978-3-540-30210-0_8

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free