Pages that link to "Item:Q1838840"

The following pages link to Structure and complexity of relational queries (Q1838840):

Displaying 50 items.

• Querying logical databases (Q579967) (← links)
• The expressiveness of a family of finite set languages (Q672126) (← links)
• Principles of programming with complex objects and collection types (Q672333) (← 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)
• Knowledgebase transformations (Q676426) (← links)
• Reusing and modifying rulebases by predicate substitution (Q676430) (← links)
• Algebraic and calculus query languages for recursively typed complex objects (Q686644) (← links)
• The alternating fixpoint of logic programs with negation (Q686646) (← links)
• Finite-model theory -- A personal perspective (Q688663) (← links)
• On the complexity of queries in the logical data model (Q688665) (← links)
• Negation in rule-based database languages: A survey (Q753476) (← links)
• A generalized closure and complement phenomenon (Q795354) (← links)
• The expressive power of stratified logic programs (Q803773) (← links)
• First-order spectra with one variable (Q909462) (← links)
• 0-1 laws and decision problems for fragments of second-order logic (Q920075) (← links)
• Parallel complexity of logical query programs (Q1104095) (← links)
• Role of determinism in query languages for data bases (Q1112628) (← links)
• An alternative way to represent the cogroup of a relation in the context of nested databases (Q1124381) (← links)
• Circumscribing DATALOG: expressive power and complexity (Q1127538) (← links)
• On the representation and querying of sets of possible worlds (Q1174717) (← 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)
• Equivalence of the relational algebra and calculus for nested relations (Q1192209) (← links)
• Capturing complexity classes by fragments of second-order logic (Q1193408) (← links)
• The functional dimension of inductive definitions (Q1193414) (← links)
• Infinitary logics and 0-1 laws (Q1193591) (← links)
• The powerset algebra as a natural tool to handle nested database relations (Q1198662) (← links)
• Query languages for hierarchic databases (Q1201723) (← 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)
• Recursive query processing: The power of logic (Q1262144) (← 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)
• Expressive power and complexity of partial models for disjunctive deductive databases (Q1274974) (← links)
• Arity bounds in first-order incremental evaluation and definition of polynomial time database queries (Q1278038) (← links)
• Hereditarily-finite sets, data bases and polynomial-time computability (Q1311973) (← links)
• Multiple total stable models are definitely needed to solve unique solution problems (Q1349967) (← links)
• Non-determinism in logic-based languages (Q1360676) (← links)
• Canonization for two variables and puzzles on the square (Q1361251) (← links)
• The expressive powers of stable models for bound and unbound DATALOG queries (Q1362337) (← links)
• The complexity of query evaluation in indefinite temporal constraint databases (Q1369238) (← links)