Inference of Termination Conditions for Numerical Loops in Prolog: 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 03:1703:17, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 2,429 bytes +2,429‎ Created page with "Title: Inference of Termination Conditions for Numerical Loops in Prolog Abstract: This research paper presents a new approach to termination analysis of numerical computations in logic programs. It discusses the challenges of analyzing such computations due to the non-well-foundedness of integers and introduces a technique that allows overcoming these difficulties. The approach is based on transforming a program in a way that allows integrating and extending techniques..."
Retrieved from "https://simplesci.org/wiki/Inference_of_Termination_Conditions_for_Numerical_Loops_in_Prolog"