Rule Ordering in Bottom-Up Fixpoint Evaluation of Logic Programs
Summary: Rule ordering for bottom-up fixpoint in logic programs; new semi-naive variants GSN/BSN (and OSN/PSN) handle broader orders. Theory: cycle-preserving vs fair orderings minimize rule applications; empirical results show gains and data-dependent trade-offs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3,602 | Implementation of the CORAL Deductive Database System | 1993 | SIGMOD | 6.9311702e-05 |
| 4,118 | Context-Sensitive Program Analysis as Database Queries | 2005 | PODS | 6.4368597e-05 |
| 7,089 | Space Optimization in the Bottom-Up Evaluation of Logic Programs | 1991 | SIGMOD | 4.8371966e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 786 | New Strategies for Computing the Transitive Closure of a Database Relation | 1987 | VLDB | 0.00016660109 |
| 5,628 | Efficient Implementation of Loops in Bottom-Up Evaluation of Logic Queries | 1990 | VLDB | 5.4030815e-05 |
Previous
Page 1 / 1
Next