CORTEXA
← Browse
arxivcs.LOcs.AIcs.SC2026-07-23

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 from a few basic pure logic programming predicate definitions. We rely on the LPTP (Logic Program Theorem Prover) system for stating and proving properties about logic programs. As the proof language of LPTP is based on natural deduction, the proofs are human readable. In our case study, we sketch in LPTP the usual proof showing the irrationality of the square root of 2. Then we describe the interactions we had with the LLM. We end up with a complete formal proof, partially generated by an LLM and fully proof-checked by LPTP.

View free PDFSource page

Related papers

arxivcs.LOcs.AIcs.SC2026-07-23

Hybrid MKNF with Classical Negation in the Rule Component

Arun Raveendran Nair Sheela, Christophe Rey, Florence De Grancey

Hybrid MKNF knowledge bases under the well-founded semantics integrate Description Logics with Logic Programming. However, they do not support classical negation in the rule component, limiting their ability to represent explicit negative knowledge. This limitation is particularl…

View free PDFSource page
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

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