Termination of General Logic Programs: 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 04:5104:51, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,325 bytes +1,325‎ Created page with "Title: Termination of General Logic Programs Research Question: How can we develop a dynamic approach to characterize the termination of general logic programs? Methodology: The researchers proposed a dynamic approach to termination analysis of general logic programs. They introduced a new formulation of SLDNF-trees, called generalized SLDNF-trees. These trees deal with negative subgoals in the same way as Prolog and exist for any general logic programs. Results: They..."
Retrieved from "https://simplesci.org/wiki/Termination_of_General_Logic_Programs"