A Backward Analysis for Constraint 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 03:5003:50, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,337 bytes +1,337‎ Created page with "Title: A Backward Analysis for Constraint Logic Programs Research Question: How can we infer the moding properties of a logic program to avoid instantiation errors when querying the program? Methodology: The authors propose an abstract interpretation scheme that automates the process of tracing control flow backward (right-to-left) to infer useful properties of initial queries. This scheme is applicable to logic programs with certain computational properties, such as t..."
Retrieved from "https://simplesci.org/wiki/A_Backward_Analysis_for_Constraint_Logic_Programs"