Greedy Algorithms in Datalog: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 15:0615:06, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,848 bytes +1,848‎ Created page with "Title: Greedy Algorithms in Datalog Research Question: How can we express and implement greedy algorithms using declarative logic-based languages like Datalog, while maintaining their efficiency? Methodology: The authors propose extending the framework of Datalog-like languages to create simple declarative formulations for greedy algorithms. They introduce primitives for choice and greedy selection, and show how to translate programs with such constructs to programs th..."
Retrieved from "https://simplesci.org/wiki/Greedy_Algorithms_in_Datalog"