Pages that link to "Item:Q1151060"

The following pages link to Computable queries for relational data bases (Q1151060):

Displaying 15 items.

• On inflationary fix-point operators safety (Q266210) (← links)
• Model checking Petri nets with names using data-centric dynamic systems (Q315291) (← links)
• The consequences of eliminating NP solutions (Q458458) (← links)
• Relational completeness of query languages for annotated databases (Q532367) (← links)
• The expressiveness of a family of finite set languages (Q672126) (← links)
• Principles of programming with complex objects and collection types (Q672333) (← links)
• The expressive power of cardinality-bounded set values in object-based data models (Q672334) (← links)
• Computing with infinitary logic (Q672337) (← links)
• A simple proof on the decidability of equivalence between recursive and nonrecursive Datalog programs (Q672662) (← links)
• A semideterministic approach to object creation and nondeterminism in database queries (Q676418) (← links)
• On the equivalence of recursive and nonrecursive Datalog programs (Q676421) (← links)
• Algebraic and calculus query languages for recursively typed complex objects (Q686644) (← links)
• A closed-form evaluation for Datalog queries with integer (gap)-order constraints (Q688670) (← links)
• The navigational power of web browsers (Q692917) (← links)
• On measuring inconsistency in definite and indefinite databases with denial constraints (Q6161468) (← links)