Linear constraint query languages expressive power and complexity

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

Authors: Stéphane Grumbach, Jianwen Su, Christophe Tollu 

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

Recommendations

• Queries with arithmetical constraints
• scientific article; zbMATH DE number 1515857
• Relational expressive power of constraint query languages
• Publication:4945218
• On the expressiveness of linear-constraint query languages for spatial databases

zbMATH Keywords

Boolean functionrelational algebradisjunctive normal formlinear constraintatomic formula

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cites Work

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

This page was built for publication: Linear constraint query languages expressive power and complexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6064293)