Abstract
In early 30s A. Tarski, motivated by a problem of automatic theorem proving in elementary algebra and geometry, suggested an algorithm for quantifier elimination in the first order theory of the reals. The complexity of Tarski’s algorithm is a non-elementary function of the format of the input formula. In mid-70s a group of algorithms appeared based on the idea of a cylindrical cell decomposition and having an elementary albeit doubly-exponential complexity, even for deciding closed existential formulae. The tutorial will explain some ideas behind a new generation of algorithms which were designed during 80s and 90s and have, in a certain sense, optimal (singly-exponential) complexity. In a useful particular case of closed existential formulae (i.e., deciding feasibility of systems of polynomial equations and inequalities) these new algorithms are theoretically superior to procedures known before in numerical analysis and computer algebra.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Vorobjov, N. (2003). Effective Quantifier Elimination over Real Closed Fields. In: Baaz, M., Makowsky, J.A. (eds) Computer Science Logic. CSL 2003. Lecture Notes in Computer Science, vol 2803. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45220-1_45
Download citation
DOI: https://doi.org/10.1007/978-3-540-45220-1_45
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40801-7
Online ISBN: 978-3-540-45220-1
eBook Packages: Springer Book Archive