Queries with Arithmetical Constraints

[1]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

[2]  L. Libkin,et al.  Relational expressive power of constraint query languages , 1998, JACM.

[3]  Yuri Gurevichz.  Metaanite Model Theory , 1997 .

[4]  Michael Benedikt,et al.  On the structure of queries in constraint query languages , 1996, Proceedings 11th Annual IEEE Symposium on Logic in Computer Science.

[5]  Zoé Lacroix,et al.  Computing Queries on Linear Constraint Databases , 1995, DBPL.

[6]  D. V. Gucht,et al.  First-order queries on finite structures over the reals , 1995, Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science.

[7]  Klaus Meer,et al.  Descriptive complexity theory over the real numbers , 1995, STOC '95.

[8]  Jan Chomicki,et al.  Measuring infinite relations , 1995, PODS '95.

[9]  Peter Z. Revesz,et al.  Datalog Queries of Set Constraint Databases , 1995, ICDT.

[10]  Stéphane Grumbach,et al.  Dense-Order Constraint Databases. , 1995, PODS 1995.

[11]  Serge Abiteboul,et al.  Foundations of Databases , 1994 .

[12]  Yuri Gurevich,et al.  Metafinite Model Theory , 1994, Inf. Comput..

[13]  Jianwen Su,et al.  Linear Constraint Query Languages: Expressive Power and Complexity , 1994, LCC.

[14]  Jianwen Su,et al.  Finitely representable databases (extended abstract) , 1994, PODS '94.

[15]  Gabriel M. Kuper,et al.  Linear vs Polynomial Constraints in Database Query Languages , 1994, PPCP.

[16]  Dina Q. Goldin,et al.  Constraint Programming and Database Query Languages , 1994, TACS.

[17]  Jan Paredaens,et al.  Towards a theory of spatial database queries (extended abstract) , 1994, PODS.

[18]  Peter Z. Revesz,et al.  A Closed-Form Evaluation for Datalog Queries with Integer (Gap)-Order Constraints , 1993, Theor. Comput. Sci..

[19]  Ronald Fagin,et al.  Finite-Model Theory - A Personal Perspective , 1990, Theor. Comput. Sci..

[20]  Gabriel M. Kuper,et al.  Aggregation in Constraint Databases , 1993, PPCP.

[21]  James Renegar,et al.  On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part III: Quantifier Elimination , 1992, J. Symb. Comput..

[22]  James Renegar,et al.  On the Computational Complexity and Geometry of the First-Order Theory of the Reals, Part I: Introduction. Preliminaries. The Geometry of Semi-Algebraic Sets. The Decision Problem for the Existential Theory of the Reals , 1992, J. Symb. Comput..

[23]  L. Blum.  A Theory of Computation and Complexity over the real numbers , 1991 .

[24]  F. Frances Yao,et al.  Computational Geometry , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[25]  Richard M. Karp,et al.  Parallel Algorithms for Shared-Memory Machines , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[26]  David S. Johnson,et al.  A Catalog of Complexity Classes , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.

[27]  J. Van Leeuwen,et al.  Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .

[28]  S. Smale,et al.  On a theory of computation and complexity over the real numbers; np-completeness , 1989 .

[29]  Neil Immerman,et al.  Languages that Capture Complexity Classes , 1987, SIAM J. Comput..

[30]  John H. Reif,et al.  The complexity of elementary algebra and geometry , 1984, STOC '84.

[31]  Uzi Vishkin,et al.  Constant Depth Reducibility , 1984, SIAM J. Comput..

[32]  Richard Hull,et al.  Relative information capacity of simple relational database schemata , 1984, SIAM J. Comput..

[33]  L. Dries.  Remarks on Tarski's problem concerning (R, +, *, exp) , 1984 .

[34]  H. Gaifman.  On Local and Non-Local Properties , 1982 .

[35]  Michael Sipser,et al.  Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[36]  David Harel,et al.  Structure and complexity of relational queries , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[37]  David Harel,et al.  Computable Queries for Relational Data Bases , 1980, J. Comput. Syst. Sci..

[38]  Jeffrey D. Ullman,et al.  Principles of Database Systems , 1980 .

[39]  J. Ferrante,et al.  The computational complexity of logical theories , 1979 .

[40]  Ronald Fagin,et al.  Probabilities on finite models , 1976, Journal of Symbolic Logic.

[41]  George E. Collins,et al.  Quantifier elimination for real closed fields by cylindrical algebraic decomposition , 1975 .

[42]  Ronald Fagin.  Generalized first-order spectra, and polynomial. time recognizable sets , 1974 .

[43]  Herbert B. Enderton,et al.  A mathematical introduction to logic , 1972 .

[44]  Chen C. Chang,et al.  Model Theory: Third Edition (Dover Books On Mathematics) By C.C. Chang;H. Jerome Keisler;Mathematics , 1966 .

[45]  A. Ehrenfeucht.  An application of games to the completeness problem for formalized theories , 1961 .

[46]  A. Tarski.  A Decision Method for Elementary Algebra and Geometry , 2023 .

[47]  Julia Robinson,et al.  Definability and decision problems in arithmetic , 1949, Journal of Symbolic Logic.