Automatic Termination Analysis for 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 01:4201:42, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 2,975 bytes +2,975‎ Created page with "Title: Automatic Termination Analysis for Logic Programs Abstract: This research focuses on developing a general framework for automatic termination analysis of logic programs. Termination, in this context, refers to the finiteness of the LD-tree constructed for the program and a given query. The study presents a method that abstracts potentially infinite structures to finite ones by mapping partial branches of the LD-tree to elements of a finite set. This approach allo..."
Retrieved from "https://simplesci.org/wiki/Automatic_Termination_Analysis_for_Logic_Programs"