Termination of Logic Programs with Dynamic Scheduling: 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,744 bytes +2,744‎ Created page with "Title: Termination of Logic Programs with Dynamic Scheduling Abstract: This research investigates the termination properties of logic programs that use dynamic scheduling. Dynamic scheduling is a mechanism that determines which atoms in a query are selectable and which ones are not, allowing for features like coroutining and parallel execution. The study focuses on nicely-moded programs and queries, and presents a weak version of the well-known switching lemma for input..."
Retrieved from "https://simplesci.org/wiki/Termination_of_Logic_Programs_with_Dynamic_Scheduling"