Space Optimization in the Bottom-Up Evaluation of Logic Programs
Summary: Space optimization in bottom-up logic-program evaluation via discarding no-longer-needed facts. Three components: propagate all derivations per fact, detect duplicate derivations, and order evaluation to minimize fact lifetimes; shows how combining methods yields a complete, more general solution than prior work. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 4,118 | Context-Sensitive Program Analysis as Database Queries | 2005 | PODS | 6.4368597e-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 |
|---|---|---|---|---|
| 7,090 | Rule Ordering in Bottom-Up Fixpoint Evaluation of Logic Programs | 1990 | VLDB | 4.8371966e-05 |
| 7,978 | How to Forget the Past Without Repeating It | 1990 | VLDB | 4.613363e-05 |
Previous
Page 1 / 1
Next