Variable independence, quantifier elimination, and constraint representations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1853, Issue , 2000, Pages 260-271

  Libkin, Leonid ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTABILITY AND DECIDABILITY; POLYNOMIAL APPROXIMATION;

CONSTRAINT CLASS; CONSTRAINT PROCESSING; DECISION PROCEDURE; MODEL-THEORETIC; POLYNOMIAL-TIME ALGORITHMS; QUANTIFIER ELIMINATION; TEMPORAL APPLICATIONS; TEMPORAL DATABASE;

AUTOMATA THEORY;

EID: 84974588212     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45022-x_23     Document Type: Conference Paper

References (25)

1. S. Basu. New results on quantifier elimination over real closed fields and applications to constraint databases. Journal of the ACM, 46 (1999), 537-555.
2. J. Bochnak, M. Coste, M.-F. Roy. Real Algebraic Geometry. Springer Verlag, 1998.
3. B.F. Caviness and J.R. Johnson, Eds. Quantifier Elimination and Cylindrical Algebraic Decomposition. Springer Verlag, 1998.
4. C.C. Chang and H.J. Keisler. Model Theory. North Holland, 1990.
5. J. Chomicki, D. Goldin and G. Kuper. Variable independence and aggregation closure. In PODS’96, pages 40-48.
6. G. E. Collins and R. Loos. Real zeros of polynomials. In Computer Algebra: Symbolic and Algebraic Computation, Springer-Verlag, 1983, pages 83-94.
7. H. B. Enderton. A Mathematical Introduction to Logic. Academic Press, New York, 1972.
8. A. Fordan and R. Yap. Early projection in CLP(R). In CP’98, pages 177-191.
9. S. Grumbach, P. Rigaux, L. Segoufin. The DEDALE system for complex spatial queries. In SIGMOD’98, pages 213-224.
10. S. Grumbach, P. Rigaux, L. Segoufin. On the orthographic dimension of constraint databases. In ICDT’99, pages 199-216.
11. W. Hodges. Model Theory. Cambridge, 1993.
12. J.-L. Imbert. Redundancy, variable elimination and linear disequations. In SLP’94, pages 139-153.
13. F. Kabanza, J.-M. Stevenne and P. Wolper. Handling infinite temporal data. Journal of Computer and System Sciences, 51 (1995), 3-17.
14. P. Kanellakis, G. Kuper, and P. Revesz. Constraint query languages. Journal of Computer and System Sciences, 51 (1995), 26-52. Extended abstract in PODS’90, pages 299-313.
15. G. Kuper, L. Libkin and J. Paredaens, eds. Constraint Databases. Springer Verlag, 2000.
16. L. Libkin. Some remarks on variable independence, closure, and orthographic dimension in constraint databases. SIGMOD Record 28(4) (1999), 24-28.
17. L. Libkin. Variable independence, quantifier elimination, and constraint representations. Bell Labs Technical Memo, 1998.
18. D. Marker, M. Messmer and A. Pillay. Model Theory of Fields. Springer Verlag, 1996.
19. A. Pillay, C. Steinhorn. Definable sets in ordered structures. III. Trans. AMS 309 (1988), 469-476.
20. J. Renegar. On the computational complexity and geometry of the first-order theory of the reals. J. Symb. Comp. 13 (1992), 255-352.
21. A. Stolboushkin and M. Tsaitlin. Finite queries do not have effective syntax. Information and Computation, 153 (1999), 99-116.
22. L. van den Dries. Remarks on Tarski’s problem concerning (R,+,*,exp). In Logic Colloquium’82, North Holland, 1984, pages 97-121.
23. L. van den Dries. Tame Topology and O-Minimal Structures. Cambridge, 1998.
24. A.J. Wilkie. Model completeness results for expansions of the ordered field of real numbers by restricted Pfaffian functions and the exponential function. J. Amer. Math. Soc. 9 (1996), 1051-1094.
25. G.M. Ziegler. Lectures on Polytopes. Springer-Verlag, 1994.