Dynamic Scheduling in Logic Programming: 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 01:5601:56, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 2,395 bytes +2,395‎ Created page with "Title: Dynamic Scheduling in Logic Programming Abstract: Dynamic scheduling is a concept in logic programming where the selection of the atom in each resolution (computation) step is determined at runtime, rather than following a fixed selection rule like the left-to-right one used in Prolog. This approach has applications in parallel programming and can improve efficiency in certain cases. Delay declarations are used to control dynamic scheduling in existing logic prog..."
Retrieved from "https://simplesci.org/wiki/Dynamic_Scheduling_in_Logic_Programming"