Skip to main content
Conference Proceedings

Linear constraint query languages expressive power and complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1995) 960 426-446
DOI: 10.1007/3-540-60178-3_96
18Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We give an AC0 upper bound on the complexity of first-oder queries over (infinite) databases defined by restricted linear constraints. This result enables us to deduce the non-expressibility of various usual queries, such as the parity of the cardinality of a set or the connectivity of a graph in first-order logic with linear constraints.

Cite

CITATION STYLE

APA

Grumbach, S., Su, J., & Tollu, C. (1995). Linear constraint query languages expressive power and complexity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 960, pp. 426–446). Springer Verlag. https://doi.org/10.1007/3-540-60178-3_96

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free