First-order queries on finite structures over the reals

SIAM Journal on Computing

Volumn 27, Issue 6, 1998, Pages 1747-1763

  Paredaens, Jan ^a   Van Den Bussche, Jan ^b   Van Gucht, Dirk ^c  

^a UNIVERSITY OF ANTWERP   (Belgium)

^b HASSELT UNIVERSITY   (Belgium)

^c INDIANA UNIVERSITY   (United States)

Author keywords

Constraint programming; First order logic; Linear arithmetic; Relational databases

Indexed keywords

BOOLEAN ALGEBRA; FORMAL LOGIC; POLYNOMIALS; PROGRAMMING THEORY; RELATIONAL DATABASE SYSTEMS;

CONSTRAINT PROGRAMMING; FIRST-ORDER LOGIC; LINEAR ARITHMETIC;

QUERY LANGUAGES;

EID: 0032315458     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S009753979629766     Document Type: Article

References (22)

1. S. ABITEBOUL, R. HULL, AND V. VIANU, Foundations of Databases, Addison-Wesley, Reading, MA, 1994.
2. A. AHO AND J. ULLMAN, Universality of data retrieval languages, in Proc. ACM Symposium on Principles of Programming Languages, ACM Press, New York, 1979, pp. 110-120.
3. D. ARNON, Geometric reasoning with logic and algebra, Artificial Intelligence, 37 (1988), pp. 37-60.
4. D. ARNON, G. COLLINS, AND S. MCCALLUM, Cylindrical algebraic decomposition, I: The basic algorithm, SIAM J. Comput., 13 (1984), pp. 865-877.
5. A. AYLAMAZYAN, M. GILULA, A. STOLBOUSHKIN, AND G. SCHWARTZ, Reducation of the relational model with infinite domains to the case of finite domains, Dokl. Akad. Nauk SSSR, 286 (1986), pp. 308-311. (In Russian.)
6. O. BELEGRADEK, A. STOLBOUSHKIN, AND M. TAITSLIN, On Order-Generic Queries, Tech. Report 96-01, DIMACS, Rutgers University, New Brunswick, NJ, 1996.
7. M. BENEDIKT, G. DONG, L. LIBKIN, AND L. WONG, Relational expressive power of constraint query languages, in Proc. 15th ACM Symposium on Principles of Database Systems, ACM Press, New York, 1996, pp. 5-16.
8. M. BENEDIKT AND L. LIBKIN, On the structure of queries in constraint query languages, in Proc. 11th IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1996, pp. 25-34.
9. F. BENHAMON AND A. COLMERAUER, EDS., Constraint Logic Programming: Selected Research, MIT Press, Cambridge, MA, 1993.
10. J. BOCHNAK, M. COSTE, AND M.-F. ROY, Géométrie algébrique réelle, Springer-Verlag, Berlin, 1987.
11. A. CHANDRA AND D. HAREL, Computable queries for relational data bases, J. Comput. System Sci., 21 (1980), pp. 156-178.
12. G. COLLINS, Quantifier Elimination for Real Closed Fields by Cylindrical Algebraic Decomposition, Lecture Notes in Computer Science 33, Springer-Verlag, New York, 1975, pp. 134-183.
13. H. ENDERTON, A Mathematical Introduction to Logic, Academic Press, New York, 1972.
14. S. GRUMBACH, J. Su, AND C. TOLLU, Linear constraint query languages: Expressive power and complexity, in Logic and Computational Complexity, D. Leivant, ed., Lecture Notes in Computer Science 960, Springer-Verlag, New York, 1995, pp. 426-446.
15. R. HULL AND J. SU, Domain independence and the relational calculus, Acta Inform., 31 (1994), pp. 513-524.
16. P. KANELLAKIS, G. KUPER, AND P. REVESZ, Constraint query languages, J. Comput. System Sci., 51 (1995), pp. 26-52.
17. G. KUPER, On the expressive power of the relational calculus with arithmetic constraints, in ICDT'90, Lecture Notes in Computer Science 470, S. Abiteboul and P. Kanellakis, eds., Springer-Verlag, New York, 1990, pp. 202-214.
18. M. OTTO AND J. VAN DEN BUSSCHE, First-order queries on databases embedded in an infinite structure, Inform. Process. Lett., 60 (1996), pp. 37-41.
19. J. PAREDAENS, J. VAN DEN BUSSCHE, AND D. VAN GUCHT, Towards a theory of spatial database queries, in Proc. 13th ACM Symposium on Principles of Database Systems, ACM Press, New York, 1994, pp. 279-288.
20. J. PAREDAENS, J. VAN DEN BUSSCHE, AND D. VAN GUCHT, First-order queries on finite structures over the reals (extended abstract), in Proc. 10th IEEE Symposium on Logic in Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1995, pp. 79-87.
21. A. STOLBOUSHKIN AND M. TAITSLIN, Linear vs. order constraints over rational databases, in Proc. 15th ACM Symposium on Principles of Database Systems, ACM Press, New York, 1996, pp. 17-27.
22. L. VAN DEN DRIES, Alfred Tarski's elimination theory for real closed fields, J. Symbol. Logic, 53 (1988), pp. 7-19.