Pages that link to "Item:Q1924723"

The following pages link to Nonrecursive incremental evaluation of Datalog queries (Q1924723):

Displaying 18 items.

• Maintaining transitive closure in first order after node-set and edge-set deletions (Q287062) (← links)
• A closed-form evaluation for Datalog queries with integer (gap)-order constraints (Q688670) (← links)
• Incremental classification of description logics ontologies (Q972428) (← links)
• Approximate well-founded semantics, query answering and generalized normal logic programs over lattices (Q1039575) (← links)
• Arity bounds in first-order incremental evaluation and definition of polynomial time database queries (Q1278038) (← links)
• Incremental and decremental evaluation of transitive closure by first- order queries (Q1898482) (← links)
• Dynamic complexity of expansion (Q2117075) (← links)
• Modular materialisation of Datalog programs (Q2144176) (← links)
• Memory-saving evaluation plans for Datalog (Q2296730) (← links)
• Maintenance of datalog materialisations revisited (Q2321273) (← links)
• The dynamic complexity of acyclic hypergraph homomorphisms (Q2672439) (← links)
• Incremental Tabling for Query-Driven Propagation of Logic Program Updates (Q2870163) (← links)
• A Top-Down Query Answering Procedure for Normal Logic Programs Under the Any-World Assumption (Q3524923) (← links)
• (Q4473152) (← links)
• SEPARATING AUXILIARY ARITY HIERARCHY OF FIRST-ORDER INCREMENTAL EVALUATION SYSTEMS USING (3K+1)-<font>ary</font> INPUT RELATIONS (Q4528763) (← links)
• (Q5002805) (← links)
• Incremental Event Calculus for Run-Time Reasoning (Q5076337) (← links)
• (Q5376663) (← links)