4 papers
Case study: solving P-99 with LPTP and an LLM
Fred Mesnard, Thierry Marianne, Étienne Payet +1
Ninety-Nine Prolog Problems (P-99) is a famous set of Prolog exercises. We solved the first thirty three just by prompting an LLM (Large Language Model). We used Claude from Anthro…
Case study: proving sqrt(2) irrational with LPTP and an LLM
Fred Mesnard, Étienne Payet, Wim Vanhoof
We present the interactions with an LLM (Large Language Model) aiming at proving that the square root of 2 is not a rational number in an LP (Logic Programming) context. We start f…
Computing Convex Hulls with a Linear Solver
Florence Benoy, Andy King, Fred Mesnard
A programming tactic involving polyhedra is reported that has been widely applied in the polyhedral analysis of (constraint) logic programs. The method enables the computations of…
cTI: A constraint-based termination inference tool for ISO-Prolog
Fred Mesnard, Roberto Bagnara
We present cTI, the first system for universal left-termination inference of logic programs. Termination inference generalizes termination analysis and checking. Traditionally, a t…