CORTEXA
← Browse
arxivcs.LOcs.AI2026-07-23

Case study: solving P-99 with LPTP and an LLM

Fred Mesnard, Thierry Marianne, Étienne Payet, Wim Vanhoof

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 Anthropic. By solved we mean: generate the Prolog code and a test file, run the tests and check whether they pass, then formally prove types, groundness, termination, uniqueness, existence and also sometimes functional correctness with LPTP (Logic Program Theorem Prover). Hence our approach is an experiment in vibe-coding/vericoding of P-99. It is a vibe-coding experiment because we started from informal specifications written in English and let Claude generate the Prolog code. It also fits within vericoding because the LLM proved reliability guarantees on the generated Prolog code. Claude wrote 58 logic procedures, 508 tests, 257 lemmas for a total of 11800 proof lines. We manually checked each file generated by the LLM. We checked the Prolog code, ran the tests, examined the logical statements generated by Claude and proof-checked Claude's proofs with LPTP. This paper describes this experiment and provides the main details so that it can be reproduced by the interested reader.

View free PDFSource page

Related papers

arxivcs.LOcs.AIcs.GT2026-07-23

Animation, Verification and Visualisation of Prolog Transition Systems with ProB

Jan Gruteser, Michael Leuschel, Katharina Engels, Fabian Vu

ProB is a Prolog-based model checker, animator and constraint solver for high-level formal specifications. One can also use ProB to animate transition systems defined by Prolog predicates, allowing the application of its various validation techniques. In this work, we present the…

View free PDFSource page
arxivcs.CCcs.AIcs.DScs.LO2026-07-23

Representative Sets in Propositional Abduction

Johannes Schmidt, Mohamed Maizia, Victor Lagerkvist, Johannes K. Fichte

The propositional abduction problem is a well-known form of non-monotonic reasoning where we are asked to find an explanation of a given manifestation. Recently, there has been an influx of results asking more refined questions about the solution space rather than only individual…

View free PDFSource page
arxivcs.AIcs.LOcs.PL2026-07-23

How Rules Represent Causal Knowledge: Causal Modeling with Probabilistic Logic Programming

Kilian Rueckschloss, Felix Weitkaemper

Pearl famously argues that causal knowledge enables the prediction of intervention effects. By contrast, purely descriptive knowledge supports only conclusions drawn from observations. His theory of causality, however, is developed exclusively within Bayesian networks and causal…

View free PDFSource page
arxivcs.LOcs.AI2026-07-23

Declarative Problem Solving in UAM Strategic Deconfliction

Gioacchino Sterlicchio, Angelo Oddi, Riccardo Rasconi, Francesca Alessandra Lisi

The growing demand for Urban Air Mobility (UAM) introduces significant challenges in airspace management, particularly within densely populated metropolitan regions. As the number of aerial vehicles-such as drones, air taxis, and helicopters-continues to rise, so does the risk of…

View free PDFSource page
arxivcs.AIcs.LOcs.PL2026-07-23

Logic Programming Semantics for Causal Processes

Felix Weitkämper

Motivated by challenging modelling issues in the life sciences, we investigate the relationship between logic programming semantics and the eventual states of causal processes compatible with those logic programs. More precisely, we show that while stable models of positive logic…

View free PDFSource page