Queries with arithmetical constraints

DOI10.1016/S0304-3975(96)00194-6zbMath0902.68044OpenAlexW1989267168MaRDI QIDQ1391932

Jianwen Su, Stéphane Grumbach

Publication date: 23 July 1998

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(96)00194-6

zbMATH Keywords

first-order logicquery language

Mathematics Subject Classification ID

Database theory (68P15)

Related Items

Quantifier rank for parity of embedded finite models. ⋮ Topological elementary equivalence of regular semi‐algebraic sets in three‐dimensional space ⋮ Topological elementary equivalence of closed semi-algebraic sets in the real plane ⋮ Aggregate operators in constraint query languages ⋮ Uniform generation in spatial constraint databases and applications ⋮ Definability of Geometric Properties in Algebraically Closed Fields ⋮ A technique for proving decidability of containment and equivalence of linear constraint queries ⋮ Constraint-generating dependencies ⋮ Querying spatial databases via topological invariants ⋮ Complete geometric query languages ⋮ On the decidability of semilinearity for semialgebraic sets and its implications for spatial databases

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite-model theory -- A personal perspective
• A closed-form evaluation for Datalog queries with integer (gap)-order constraints
• The complexity of elementary algebra and geometry
• Computable queries for relational data bases
• On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
• Model theory.
• The computational complexity of logical theories
• Computability and complexity in analysis
• Finitely representable databases
• Metafinite model theory
• Structure and complexity of relational queries
• Fast multiplication of large numbers
• An application of games to the completeness problem for formalized theories
• Parity, circuits, and the polynomial-time hierarchy
• Constant Depth Reducibility
• Relative Information Capacity of Simple Relational Database Schemata
• Languages that Capture Complexity Classes
• Probabilities on finite models
• First-Order Queries on Finite Structures Over the Reals
• On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
• A relational model of data for large shared data banks
• Definability and decision problems in arithmetic