Linear Constraint Query Languages: Expressive Power and Complexity

We give an AC0 upper bound on the complexity of rst-oder queries over (in nite) databases de ned 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 rst-order logic with linear constraints.

• Type: Conference
• Year: 1994
• Where: LCC
• Authors: Stéphane Grumbach, Jianwen Su, Christophe Tollu
• Keywords: Algorithms, LCC 1994, Linear Constraints, Restricted Linear Constraints, Various Usual Queries