Inferring Termination Conditions 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 15:0315:03, 24 December 2023SatoshiNakamoto talk contribs 1,100 bytes +1,100 Created page with "Title: Inferring Termination Conditions for Logic Programs Research Question: How can we develop a method to infer termination conditions for logic programs, going beyond traditional termination analysis? Methodology: The authors propose a methodology that combines traditional termination analysis with backwards analysis. This allows them to create an analyzer that not only checks for termination but also infers it. Results: The authors demonstrate their methodology b..."