DBScholar

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
958
Venue
PODS
Year
1992
Pagerank
6.7791707e-05
Overall Rank
4,290 | 70.57%
DOI
10.1145/137097.137836

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{greco_pods92,
        address = {New York, NY, USA},
        series = {{PODS} '92},
        title = {{Greedy by Choice}},
        url = {https://dl.acm.org/doi/10.1145/137097.137836},
        doi = {10.1145/137097.137836},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Greco, Sergio and Zaniolo, Carlo and Ganguly, Sumit},
        year = {1992}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
2,194 CORAL—Control, Relations and Logic 1992 VLDB 8.9724143e-05
2,600 Convergence of Datalog over (Pre-) Semirings 2022 PODS 8.3571843e-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,560 Minimum and Maximum Predicates in Logic Programming 1991 PODS 7.3094581e-05
4,831 Stable Models and Non-Determinism in Logic Programs with Negation 1990 PODS 6.4877275e-05
Previous Page 1 / 1 Next

Semantically Similar Papers