## New Results on Quantifier Elimination Over Real Closed Fields and Applications to Constraint Databases (1999)

Venue: | Journal of the ACM |

Citations: | 32 - 4 self |

### BibTeX

@ARTICLE{Basu99newresults,

author = {Saugata Basu},

title = {New Results on Quantifier Elimination Over Real Closed Fields and Applications to Constraint Databases},

journal = {Journal of the ACM},

year = {1999},

volume = {46},

pages = {537--555}

}

### Years of Citing Articles

### OpenURL

### Abstract

In this paper we give a new algorithm for quantifier elimination in the first order theory of real closed fields that improves the complexity of the best known algorithm for this problem till now. Unlike previously known algorithms [3, 28, 22] the combinatorial part of the complexity (the part depending on the number of polynomials in the input) of this new algorithm is independent of the number of free variables. Moreover, under the assumption that each polynomial in the input depend only on a constant number of the free variables, the algebraic part of the complexity (the part depending on the degrees of the input polynomials) can also be made independent of the number of free variables. This new feature of our algorithm allows us to obtain a new algorithm for a variant of the quantifier elimination problem. We give an almost optimal algorithm for this new problem, which we call the uniform quantifier elimination problem. Using the uniform quantifier elimination algorithm, we give a...

### Citations

563 |
A Decision Method for Elementary Algebra and Geometry, University of Califonia Press, 2nd edition, revised
- Tarski
- 1951
(Show Context)
Citation Context ... from a uniform sequence of formulas and obtain another uniform sequence of quantifier free formulas. 4 1.3 History The existence of an algorithm for quantifier elimination was first proved by Tarski =-=[31]-=- (see also [29]). However, the complexity of his algorithm is not elementary recursive. The first algorithm with a an elementary-recursive worst-case time bound was given by Collins [11]. His algorith... |

373 |
Quantifier elimination for real closed fields by cylindrical algebraic decomposition, Quantifier elimination and cylindrical algebraic decomposition
- Collins
- 1993
(Show Context)
Citation Context ...ved by Tarski [31] (see also [29]). However, the complexity of his algorithm is not elementary recursive. The first algorithm with a an elementary-recursive worst-case time bound was given by Collins =-=[11]-=-. His algorithm had a worst case running time doubly exponential in the number of variables. Heintz, Roy and Solerno [22] and Renegar [28] gave quantifier elimination algorithms which were doubly expo... |

360 |
Lecture on Polytopes
- Ziegler
- 1995
(Show Context)
Citation Context ...g one quantifier corresponds to the problem of projecting a given semi-linear set to one lower dimension. The classical algorithm for projecting semi-linear sets is the Fourier-Motzkin algorithm (see =-=[34]-=- page 35) which requires s 2 arithmetic operations. However, if we use the general quantifier elimination algorithm in [3] in this special case, the complexity is easily seen to be O(s 2k ): Thus, the... |

336 | Constraint query languages
- Kanellakis, Kuper, et al.
- 1995
(Show Context)
Citation Context ...abases We now describe the application of uniform quantifier elimination to the theory of constraint databases. In recent years, constraint databases, first introduced by Kanellakis, Kuper and Revesz =-=[27]-=- has attracted a lot of attention. Unlike traditional databases which are finite collections of data items, constraint databases permit infinite collections of items to be stored in the database. They... |

270 |
Principle of Database Systems
- Ullman
- 1982
(Show Context)
Citation Context ...bases which are finite collections of data items, constraint databases permit infinite collections of items to be stored in the database. They are a powerful generalization of Codd's relational model =-=[32]-=-. Different types of constraints have been considered by various authors [27, 26, 17] including dense linear order inequalities, real polynomial inequalities etc. Even though constraint databases perm... |

196 | On the combinatorial and algebraic complexity of quantifier elimination
- Basu, Pollack, et al.
- 1996
(Show Context)
Citation Context ...rithm for quantifier elimination in the first order theory of real closed fields that improves the complexity of the best known algorithm for this problem till now. Unlike previously known algorithms =-=[3, 28, 22]-=- the combinatorial part of the complexity (the part depending on the number of polynomials in the input) of this new algorithm is independent of the number of free variables. Moreover, under the assum... |

157 |
Géométrie algébrique réelle
- Bochnak, Coste, et al.
- 1987
(Show Context)
Citation Context ...ailed description of these subroutines. For x 2 R and f 2 R[X] we write oe x;f for the sign vector (sign(f (0) (x)); sign(f (1) (x)); : : : ; sign(f (deg(f)) (x): It is a consequence of Thom's lemma (=-=[9]-=-, [12]) that if f(x) = 0 then oe x;f distinguishes x from all the other roots of f and if oe x;f 6= oe y;f then these two sign vectors easily enable us to determine whether x ! y or y ! x. 12 A k-univ... |

153 | Logic and the challenge of computer science
- Gurevich
- 1988
(Show Context)
Citation Context ...ty has been shown using different proof techniques such as locality [16], 0/1 laws [14, 15], EhrenfeuchtFraisse games [13]. These undefinability results also hold in the presence of an order relation =-=[21]-=-. Grumbach and Su [17] proved that parity is not definable over constraint databases with linear constraints. They also conjectured that parity is not definable over the reals with queries allowed to ... |

129 |
On local and non-local properties
- Gaifman
- 1982
(Show Context)
Citation Context ...well-known examples of queries that are not definable over finite models in a first order language with equality. Their undefinability has been shown using different proof techniques such as locality =-=[16]-=-, 0/1 laws [14, 15], EhrenfeuchtFraisse games [13]. These undefinability results also hold in the presence of an order relation [21]. Grumbach and Su [17] proved that parity is not definable over cons... |

122 |
Probabilities on finite models
- Fagin
(Show Context)
Citation Context ...ples of queries that are not definable over finite models in a first order language with equality. Their undefinability has been shown using different proof techniques such as locality [16], 0/1 laws =-=[14, 15]-=-, EhrenfeuchtFraisse games [13]. These undefinability results also hold in the presence of an order relation [21]. Grumbach and Su [17] proved that parity is not definable over constraint databases wi... |

90 |
A new decision method for elementary algebra
- Seidenberg
- 1954
(Show Context)
Citation Context ... sequence of formulas and obtain another uniform sequence of quantifier free formulas. 4 1.3 History The existence of an algorithm for quantifier elimination was first proved by Tarski [31] (see also =-=[29]-=-). However, the complexity of his algorithm is not elementary recursive. The first algorithm with a an elementary-recursive worst-case time bound was given by Collins [11]. His algorithm had a worst c... |

84 |
Almost tight upper bounds for lower envelopes in higher dimensions
- Sharir
- 1994
(Show Context)
Citation Context ...ature). Recently however, there have been efforts to generalize computational geometry algorithms to problems where the constraints are low degree polynomials, not just linear ones (see, for example, =-=[1, 30, 24, 25, 5]-=- and also the survey by Chazelle [10]). From this point of view it makes sense to separate out the roles of the parameters s and d in the complexity analysis of algorithms in semi-algebraic geometry. ... |

81 |
The complexity of linear problems in fields
- Weispfenning
- 1988
(Show Context)
Citation Context ... in the number of variables. Heintz, Roy and Solerno [22] and Renegar [28] gave quantifier elimination algorithms which were doubly exponential only in the number of quantifier alternations. See also =-=[33]-=- for the lower bound proof. The best algorithm for this problem till now appeared in [3], which has a complexity of s (`+1)\Pi(k i +1) d (`+1)\PiO(k i ) : Moreover, the degrees of the polynomials appe... |

77 | Relational Expressive Power of Constraint Query Languages
- Benedikt, Dong, et al.
- 1998
(Show Context)
Citation Context ...omial constraints. We give an algorithm for converting a query with natural domain semantics to an equivalent one with active domain semantics. A non-constructive version of this result was proved in =-=[6]-=-. Very This work was done while the author was a post-doctoral fellow at the Mathematical Sciences Research Institute, Berkeley. A preliminary version of this paper appeared in the Proceedings of the ... |

63 |
On the computational complexity and geometry of the first order theory of the reals
- Renegar
- 1992
(Show Context)
Citation Context ...rithm for quantifier elimination in the first order theory of real closed fields that improves the complexity of the best known algorithm for this problem till now. Unlike previously known algorithms =-=[3, 28, 22]-=- the combinatorial part of the complexity (the part depending on the number of polynomials in the input) of this new algorithm is independent of the number of free variables. Moreover, under the assum... |

60 | Constraint Programming and Database Query Languages. Invited paper, Symposium on Theoretical Aspects of Computer Software
- Kanellakis, Goldin
- 1994
(Show Context)
Citation Context ... infinite collections of items to be stored in the database. They are a powerful generalization of Codd's relational model [32]. Different types of constraints have been considered by various authors =-=[27, 26, 17]-=- including dense linear order inequalities, real polynomial inequalities etc. Even though constraint databases permit infinite number of elements in the database, for the purposes of this paper it is ... |

59 | New bounds for lower envelopes in three dimensions with applications to visibility of terrains. Discrete Comput
- Halperin, Sharir
- 1994
(Show Context)
Citation Context ...ature). Recently however, there have been efforts to generalize computational geometry algorithms to problems where the constraints are low degree polynomials, not just linear ones (see, for example, =-=[1, 30, 24, 25, 5]-=- and also the survey by Chazelle [10]). From this point of view it makes sense to separate out the roles of the parameters s and d in the complexity analysis of algorithms in semi-algebraic geometry. ... |

55 | Finitely Representable Databases., in "J - GRUMBACH, SU - 1997 |

42 |
On range searching with semialgebraic sets, Discrete Comput
- Agarwal, Matouˇsek
- 1994
(Show Context)
Citation Context ... Y 1 ; : : : ; Y ` . The degrees of the polynomials are bounded by d and their coefficients lie in a real closed field R: We are also given a first-order formula of the form (Q ! X [!] ) : : : (Q 1 X =-=[1]-=- )F (P 1 ; : : : ; P s ) (henceforth denoted \Phi(Y )) where Q i 2 f8; 9g; Q i 6= Q i+1 , Y = (Y 1 ; : : : ; Y ` ) is a block of ` free variables, X [i] is a block of k i variables with P 1i! k i = k;... |

40 |
Sur la complexité du principe de Tarski-Seidenberg
- Heintz, Roy, et al.
- 1990
(Show Context)
Citation Context ...rithm for quantifier elimination in the first order theory of real closed fields that improves the complexity of the best known algorithm for this problem till now. Unlike previously known algorithms =-=[3, 28, 22]-=- the combinatorial part of the complexity (the part depending on the number of polynomials in the input) of this new algorithm is independent of the number of free variables. Moreover, under the assum... |

32 | Complexity of deciding tarski algebra - Grigor’ev - 1988 |

29 | Almost tight upper bounds for the single cell and zone problems in three dimensions
- Halperin, Sharir
- 1995
(Show Context)
Citation Context ...ature). Recently however, there have been efforts to generalize computational geometry algorithms to problems where the constraints are low degree polynomials, not just linear ones (see, for example, =-=[1, 30, 24, 25, 5]-=- and also the survey by Chazelle [10]). From this point of view it makes sense to separate out the roles of the parameters s and d in the complexity analysis of algorithms in semi-algebraic geometry. ... |

28 |
Finite model theory – a personal perspective
- Fagin
- 1993
(Show Context)
Citation Context ...ples of queries that are not definable over finite models in a first order language with equality. Their undefinability has been shown using different proof techniques such as locality [16], 0/1 laws =-=[14, 15]-=-, EhrenfeuchtFraisse games [13]. These undefinability results also hold in the presence of an order relation [21]. Grumbach and Su [17] proved that parity is not definable over constraint databases wi... |

27 | On the structure of queries in constraint query languages
- Benedikt, Libkin
- 1996
(Show Context)
Citation Context ...y with natural domain semantics, outputs another query equivalent to it with active domain semantics. The equivalence of natural and active domain semantics over real closed fields was proved in [6], =-=[7]-=-. However, their proofs are essentially nonconstructive and one does not obtain an effective algorithm for converting a query with the natural domain semantics into an equivalent one with active domai... |

22 | Description of the connected components of a semialgebraic set in single exponential time, Discrete Comput - Heintz, Roy, et al. - 1994 |

17 | On the combinatorial and topological complexity of a single cell
- Basu
(Show Context)
Citation Context |

17 |
Computational geometry: a retrospective
- Chazelle
- 1994
(Show Context)
Citation Context ...o generalize computational geometry algorithms to problems where the constraints are low degree polynomials, not just linear ones (see, for example, [1, 30, 24, 25, 5] and also the survey by Chazelle =-=[10]-=-). From this point of view it makes sense to separate out the roles of the parameters s and d in the complexity analysis of algorithms in semi-algebraic geometry. We call the part that depends on s th... |

10 | Complexity of computing semialgebraic descriptions of the connected components of a semialgebraic set - Basu, Pollack, et al. - 1998 |

9 | Dense Order Constraint Databases - Grumbach, Su - 1995 |

7 |
Ehrenfeucht an application of games to the completeness problem for formalized theories
- unknown authors
(Show Context)
Citation Context ...ble over finite models in a first order language with equality. Their undefinability has been shown using different proof techniques such as locality [16], 0/1 laws [14, 15], EhrenfeuchtFraisse games =-=[13]-=-. These undefinability results also hold in the presence of an order relation [21]. Grumbach and Su [17] proved that parity is not definable over constraint databases with linear constraints. They als... |

3 | Uniform Quantifier Elimination and Constraint Query - Basu - 1997 |

2 |
Relational Languages over Interpreted Structure
- Benedikt, Libkin
- 1997
(Show Context)
Citation Context ...A preliminary version of this paper appeared in the Proceedings of the 38th IEEE Symposium on the Foundations of Computer Science, 1997. recently, a constructive proof was also given independently in =-=[8]-=-. However, complexity issues were not considered and no algorithm with a reasonable complexity bound was known for this latter problem till now. We also point out interesting logical consequences of t... |

2 |
M.-.F Roy Thom's lemma, the coding of real algebraic numbers and the topology of semi-algebraic sets
- Coste
- 1988
(Show Context)
Citation Context ... description of these subroutines. For x 2 R and f 2 R[X] we write oe x;f for the sign vector (sign(f (0) (x)); sign(f (1) (x)); : : : ; sign(f (deg(f)) (x): It is a consequence of Thom's lemma ([9], =-=[12]-=-) that if f(x) = 0 then oe x;f distinguishes x from all the other roots of f and if oe x;f 6= oe y;f then these two sign vectors easily enable us to determine whether x ! y or y ! x. 12 A k-univariate... |