Automatic Termination Inference 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 2023SatoshiNakamoto talk contribs 2,055 bytes +2,055 Created page with "Title: Automatic Termination Inference for Numerical Loops in Prolog Abstract: This research focuses on automatic termination inference for logic programs that depend on numerical computations. The study investigates the termination behavior of integer computations and proposes two approaches to solve the problem. The first approach involves changing the definition of the level mapping to map atoms to integers, ensuring that the mapping is to some well-founded subset of..."