Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

18

LCC
1994

favoriteEmaildiscussreport

213views Algorithms» more LCC 1994»

Linear Constraint Query Languages: Expressive Power and Complexity

13 years 8 months ago

Linear Constraint Query Languages: Expressive Power and Complexity

Download www.cs.ucsb.edu

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.

Stéphane Grumbach, Jianwen Su, Christophe T

Real-time Traffic

Algorithms | LCC 1994 | Linear Constraints | Restricted Linear Constraints | Various Usual Queries |

claim paper

Related Content

» Relational Expressive Power of Constraint Query Languages

» Adding a path connectedness operator to FOpoly linear

» Pasta3s Graphical Query Language Direct Manipulation Cooperative Queries Full Expressive P...

» Symmetric Datalog and Constraint Satisfaction Problems in Logspace

» Reasoning over Conceptual Schemas and Queries in Temporal Databases

» Approximating the Expressive Power of Logics in Finite Models

» Constraint Databases Data Structures and Efficient Query Evaluation

» Querying Temporal Constraint Networks A Unifying Approach

» Linear Time Logics Around PSL Complexity Expressiveness and a Little Bit of Succinctness

Post Info
More Details (n/a)

Added	10 Aug 2010
Updated	10 Aug 2010
Type	Conference
Year	1994
Where	LCC
Authors	Stéphane Grumbach, Jianwen Su, Christophe Tollu

Comments (0)