Database Paper Browser

Back to papers

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)

Paper ID
959
Venue
PODS
Year
1992
Pagerank
7.2519332e-05
Overall Rank
3,299 | 77.08%
DOI
-

Incoming Non-self Citations Over Time

Authors

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.00010945869
2,912 Convergence of Datalog over (Pre-) Semirings 2022 PODS 7.9261665e-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,452 Minimum and Maximum Predicates in Logic Programming 1991 PODS 7.0792604e-05
4,754 Stable Models and Non-Determinism in Logic Programs with Negation 1990 PODS 5.9377721e-05
Previous Page 1 / 1 Next

Semantically Similar Papers