Queries with arithmetical constraints

1997/02/01 by Stéphane Grumbach, Jianwen Su · 1 citation
Computer Science · Mathematics · #Advanced Database Systems and Queries #Arithmetic function #Computer science #Constraint (computer-aided design) #Data Management and Algorithms #Database #Discrete mathematics #Expressive power #First-order logic #Logic, Reasoning, and Knowledge #Mathematics #Query language #Reduction (mathematics) #Relational database #Theoretical computer science

paper · pdf · doi:10.1016/s0304-3975(96)00194-6

crossref issued 1997/02/01 · crossref published 1997/02/01 · crossref published-print 1997/02/01 · openalex publication_date 1997/02/01 · crossref created 2003/04/23 · crossref deposited 2019/04/16 · crossref indexed 2023/12/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/02

Citations

• The Computational Complexity of Logical Theories
• Languages that Capture Complexity Classes
• 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
• Definability and decision problems in arithmetic
• Finite-model theory - a personal perspective
• Parity, circuits, and the polynomial-time hierarchy
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• Schnelle Multiplikation großer Zahlen
• Probabilities on finite models
• Relational expressive power of constraint query languages
• A relational model of data for large shared data banks
• Probabilities on finite models

Cited by

• Paris Kanellakis [wikipedia]