Linear constraint query languages expressive power and complexity

DOI10.1007/3-540-60178-3_96OpenAlexW1576415620MaRDI QIDQ6064293

Christophe Tollu, Jianwen Su, Stéphane Grumbach

Publication date: 12 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-60178-3_96

zbMATH Keywords

relational algebraBoolean functiondisjunctive normal formlinear constraintatomic formula

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The complexity of elementary algebra and geometry
• Computable queries for relational data bases
• Hamiltonian paths in infinite graphs
• On the expressive power of the relational algebra
• Finitely representable databases
• Completeness results for recursive data bases
• Parity, circuits, and the polynomial-time hierarchy
• Sentences true in all constructive models
• Recursive Euler and Hamilton Paths
• First-Order Queries on Finite Structures Over the Reals
• A relational model of data for large shared data banks