Greedy by Choice
Summary: Adds 'least' and 'choice' to Datalog under stable-model semantics, defining a compile-time-recognizable class of 'stage-stratified' programs to declaratively capture greedy algorithms. Provides fixpoint compilation and storage techniques achieving asymptotic costs comparable to procedural greedy implementations. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Sergio Greco
- 2. Carlo Zaniolo
- 3. Sumit Ganguly
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,668 | CORAL—Control, Relations and Logic* | 1992 | VLDB | 0.00010956582 |
| 2,907 | Convergence of Datalog over (Pre-) Semirings | 2022 | PODS | 7.933806e-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 |
|---|---|---|---|---|
| 3,446 | Minimum and Maximum Predicates in Logic Programming | 1991 | PODS | 7.0861064e-05 |
| 4,757 | Stable Models and Non-Determinism in Logic Programs with Negation | 1990 | PODS | 5.9434944e-05 |
Previous
Page 1 / 1
Next