Solving Geometric Problems with Real Quantifier Elimination

Authors:
Andreas Dolzmann
Affiliations:
-
Venue:
ADG '98 Proceedings of the Second International Workshop on Automated Deduction in Geometry
Year:
1998

Citing 13
Cited 1

Cylindrical algebraic decomposition I: the basic algorithm

SIAM Journal on Computing
The complexity of linear problems in fields

Journal of Symbolic Computation
An improvement of the projection operator in cylindrical algebraic decomposition

ISSAC '90 Proceedings of the international symposium on Symbolic and algebraic computation
Partial Cylindrical Algebraic Decomposition for quantifier elimination

Journal of Symbolic Computation
Simple solution formula construction in cylindrical algebraic decomposition based quantifier elimination

ISSAC '92 Papers from the international symposium on Symbolic and algebraic computation
REDLOG: computer algebra meets computer logic

ACM SIGSAM Bulletin
Simplification of quantifier-free formulae over ordered fields

Journal of Symbolic Computation - Special issue: applications of quantifier elimination
Simplification of truth-invariant cylindrical algebraic decompositions

ISSAC '98 Proceedings of the 1998 international symposium on Symbolic and algebraic computation
P-adic constraint solving

ISSAC '99 Proceedings of the 1999 international symposium on Symbolic and algebraic computation
A New Approach for Automatic Theorem Proving in Real Geometry

Journal of Automated Reasoning
Hauptvortrag: Quantifier elimination for real closed fields by cylindrical algebraic decomposition

Proceedings of the 2nd GI Conference on Automata Theory and Formal Languages
Counting real zeros

Counting real zeros
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)

Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)

Cited References

Computer algebra handbook

Quantified Score

Hi-index	0.00

Visualization

Abstract

Many problems arising in real geometry can be formulated as first-order formulas. Thus quantifier elimination can be used to solve these problems. In this note, we discuss the applicability of implemented quantifier elimination algorithms for solving geometrical problems. In particular, we demonstrate how the tools of redlog can be applied to solve a real implicitization problem, namely the Enneper surface.