Variable Independence for First-Order Definable Constraints

ACM Transactions on Computational Logic

Volumn 4, Issue 4, 2003, Pages 431-451

  Libkin, Leonid ^a  

^a UNIVERSITY OF TORONTO   (Canada)

Author keywords

definable sets; First order logic; Languages; linear constraints; polynomial constraints; spatio temporal databases; Theory; variable independence

Indexed keywords

DEFINABLE SETS; FIRST-ORDER LOGIC; POLYNOMIAL CONSTRAINTS; SPATIO-TEMPORAL DATABASES; VARIABLE INDEPENDENCE;

ALGORITHMS; COMPUTER SIMULATION; DATABASE SYSTEMS; DECISION MAKING; FORMAL LANGUAGES; FORMAL LOGIC; LOGIC PROGRAMMING; MATHEMATICAL MODELS; POLYNOMIALS;

CONSTRAINT THEORY;

EID: 3042813187     PISSN: 15293785     EISSN: 1557945X     Source Type: Journal    
DOI: 10.1145/937555.937557     Document Type: Article

References (29)

1. Abnon, D., Collins, G., and Mccallum, S. 1988. Cylindrical algebraic decomposition: an adjacency algorithm for three-dimensional space. J. Symbolic Computation 5, 163-187.
2. Basu, S. 1999. New results on quantifier elimination over real closed fields and applications to constraint databases. J. ACM 46, 537-555.
3. Benedikt, M. and Libkin, L. 2000. Relational queries over interpreted structures. J. ACM47, 644-680.
4. Bochnak, J., Coste, M., and Boy, M.-F. 1998. Real Algebraic Geometry. Springer Verlag, Berlin.
5. Caviness, B. and Johnson, J., Eds. 1998. Quantifier Elimination and Cylindrical Algebraic Decomposition. Springer Verlag, Berlin.
6. Chang, C. and Keisler, H. J. 1990. Model Theory. North Holland, Amsterdam.
7. Chapuis, O. and Koiran, P. 1999. Definability of geometric properties in algebraically closed fields. Mathematical Logic Quarterly 45, 533-550.
8. Chomicki, J., Goldin, D., and Kuper, G. 1996. Variable independence and aggregation closure. In Symposium on Principles of Database Systems. ACM Press, New York, pages 40-48.
9. Collins, G. E., and Loos, R. 1983. Real zeros of polynomials. In Computer Algebra: Symbolic and Algebraic Computation. Springer-Verlag, pages 83-94.
10. Cosmadakis, S., Kuper, G., and Libkin, L. 2001. On the orthographic dimension of definable sets. Information Processing Letters 79, 141-145.
11. Enderton, H. B. 1972. A Mathematical Introduction to Logic. Academic Press, New York.
12. Fordan, A. and Yap, R. 1998. Early projection in CLP(R). In Constraint Programming. Springer, Berlin, pages 177-191.
13. Grumbach, S., Rigaux, P., and Segoufin, L. 1998. The DEDALE system for complex spatial queries. In ACM SIGMOD. ACM Press, New York, pages 213-224.
14. Grumbach, S., Rigaux, P., and Segoufin, L. 1999. On the orthographic dimension of constraint databases. In International Conference on Database Theory. Springer Verlag, Berlin, pages 199-216.
15. Hodges, W. 1993. Model Theory. Cambridge Univ. Press, Cambridge.
16. Imbert, J.-L. 1994. Redundancy, variable elimination and linear disequations. In Symposium on Logic Programming, pages 139-153.
17. Kabanza, F., Stevenne, J.-M., and Wolper, P. 1995. Handling infinite temporal data. J. Comput. Syst. Sci. 51, 3-17.
18. Kanellakis, P., Kuper, G., and Revesz, P. 1995. Constraint query languages. J Comput. Syst. Sci. 51, 26-52.
19. Kuper, G., Libkin, L., and Paredaens, J., Eds. 2000. Constraint Databases. Springer Verlag, Berlin.
20. Lafferriere, G., Pappas, G., and Sastry, S. 2000. O-minimal hybrid systems. Mathematics of Control, Signals, and Systems 13, 1-21.
21. Libkin, L. 1999. Some remarks on variable independence, closure, and orthographic dimension in constraint databases. SIGMOD Record 28, 4, 24-28.
22. Marker, D., Messmer, M., and Pillay, A. 1996. Model Theory of Fields. Springer Verlag, Berlin.
23. Pillay, A. and Steinhorn, C. 1988. Definable sets in ordered structures. III. Trans. AMS 309, 469-476.
24. Renegar, J. 1992. On the computational complexity and geometry of the first-order theory of the reals. J Symb. Comp. 13, 255-352.
25. Stolboushkin, A. and Tsaitlin, M. 1999. Finite queries do not have effective syntax. Information and Computation 153, 99-116.
26. Van Den Dries, L. 1984. Remarks on Tarski's problem concerning (R, +, *, exp). In Logic Collo-quium'82. North Holland, Amsterdam, pages 97-121.
27. Van Den Dries, L. 1998. Tame Topology and O-Minimal Structures. Cambridge Univ. Press, Cambridge.
28. Wilkie, A. 1996. 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, 1051-1094.
29. Ziegler, G. M. 1994. Lectures on Polytopes. Springer-Verlag, Berlin.