Pages that link to "Item:Q3753525"

The following pages link to Relational queries computable in polynomial time (Q3753525):

Displaying 50 items.

• Conjunctive and Boolean grammars: the true general case of the context-free grammars (Q394967) (← links)
• The complexity of higher-order queries (Q498405) (← links)
• On the expressive power of counting (Q672336) (← links)
• Computing with infinitary logic (Q672337) (← links)
• A simple proof on the decidability of equivalence between recursive and nonrecursive Datalog programs (Q672662) (← links)
• On the equivalence of recursive and nonrecursive Datalog programs (Q676421) (← links)
• Languages PQL and FO+LFP remain equivalent even in the absence of order (Q677720) (← links)
• The alternating fixpoint of logic programs with negation (Q686646) (← links)
• Finite-model theory -- A personal perspective (Q688663) (← links)
• A closed-form evaluation for Datalog queries with integer (gap)-order constraints (Q688670) (← links)
• Procedural languages for database queries and updates (Q751799) (← links)
• Negation in rule-based database languages: A survey (Q753476) (← links)
• The expressive power of stratified logic programs (Q803773) (← links)
• First-order spectra with one variable (Q909462) (← links)
• A uniform method for proving lower bounds on the computational complexity of logical theories (Q917543) (← links)
• Parametrization over inductive relations of a bounded number of variables (Q917545) (← links)
• 0-1 laws and decision problems for fragments of second-order logic (Q920075) (← links)
• When is arithmetic possible? (Q922533) (← links)
• Expressive power and abstraction in Essence (Q941820) (← links)
• Mathematical logic and quantum finite state automata (Q1017412) (← links)
• Polynomial queries to relational data bases (Q1067795) (← links)
• The computational complexity of asymptotic problems. I: Partial orders (Q1115860) (← links)
• Descriptive characterizations of computational complexity (Q1123616) (← links)
• Choiceless polynomial time (Q1125059) (← links)
• Circumscribing DATALOG: expressive power and complexity (Q1127538) (← links)
• Arithmetizing uniform \(NC\) (Q1176198) (← links)
• Datalog extensions for database queries and updates (Q1176285) (← links)
• Why not negation by fixpoint? (Q1176286) (← links)
• On the expressive power of database queries with intermediate types (Q1176290) (← links)
• A comparison between algebraic query languages for flat and nested databases (Q1177142) (← links)
• An analysis of fixed-point queries on binary trees (Q1183571) (← links)
• The expressive power of the bounded-iteration construct (Q1186517) (← links)
• The invariant problem for binary string structures and the parallel complexity theory of queries (Q1191022) (← links)
• Capturing complexity classes by fragments of second-order logic (Q1193408) (← links)
• Infinitary logics and 0-1 laws (Q1193591) (← links)
• Bounded linear logic: A modular approach to polynomial-time computability (Q1193854) (← links)
• The parallel complexity of single rule logic programs (Q1202885) (← links)
• An optimal lower bound on the number of variables for graph identification (Q1204528) (← links)
• Permutation dependency in datalog programs (Q1208139) (← links)
• On winning strategies in Ehrenfeucht-Fraïssé games (Q1269907) (← links)
• An extension of fixpoint logic with a symmetry-based choice construct (Q1271477) (← links)
• Reflective relational machines (Q1271557) (← links)
• A restricted second order logic for finite structures (Q1271559) (← links)
• Semantics and expressiveness issues in active databases (Q1278040) (← links)
• The expressive power of stratified logic programs with value invention (Q1281496) (← links)
• Positive versions of polynomial time (Q1281503) (← links)
• Hereditarily-finite sets, data bases and polynomial-time computability (Q1311973) (← links)
• Context-sensitive transitive closure operators (Q1319508) (← links)
• Non-determinism in logic-based languages (Q1360676) (← links)
• Canonization for two variables and puzzles on the square (Q1361251) (← links)