Pages that link to "Item:Q960526"

The following pages link to On the expressive power of Datalog: tools and a case study. (Q960526):

Displaying 17 items.

• Inherent complexity of recursive queries (Q696953) (← links)
• A more general theory of static approximations for conjunctive queries (Q778535) (← links)
• Universal algebra and hardness results for constraint satisfaction problems (Q1014634) (← links)
• Expressive power and complexity of partial models for disjunctive deductive databases (Q1274974) (← links)
• How to define a linear order on finite models (Q1371431) (← links)
• Conjunctive-query containment and constraint satisfaction (Q1591157) (← links)
• How many variables are needed to express an existential positive query? (Q2322719) (← links)
• On the speed of constraint propagation and the time complexity of arc consistency testing (Q2409578) (← links)
• On digraph coloring problems and treewidth duality (Q2427534) (← links)
• A combinatorial characterization of resolution width (Q2475405) (← links)
• Semantic Acyclicity on Graph Databases (Q3187172) (← links)
• A More General Theory of Static Approximations for Conjunctive Queries (Q3305350) (← links)
• OMITTING TYPES, BOUNDED WIDTH AND THE ABILITY TO COUNT (Q3398315) (← links)
• On the Decision Problem for Two-Variable First-Order Logic (Q4338040) (← links)
• Dualities for Constraint Satisfaction Problems (Q5504701) (← links)
• On Monotonic Determinacy and Rewritability for Recursive Queries and Views (Q5886523) (← links)
• Arboreal Categories: An Axiomatic Theory of Resources (Q6135784) (← links)