arrow
Return

Checking Linear Integer Arithmetic Proofs in Lambdapi

delete2026-01-01
delete0
delete
OA
AI
A
Alessio Coltellacci
S
Stephan Merz *
DOI:10.1007/978-3-032-04167-8_20delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Modern SMT solvers can generate proofs of unsatisfiability so that the result can be checked independently. A dependable approach to verify these proofs is to reconstruct them within a proof assistant. In previous work, the SMT checker Carcara was extended to reconstruct SMT proofs in Lambdapi-a proof assistant designed for interoperability, supporting the import and export of proofs for integration with other proof assistants such as Rocq, Lean, or HOL- Light. Whereas that work was limited to SMT theories without arithmetic, we here present an extension that enables the reconstruction of SMT proofs involving linear integer arithmetic.
Keywords:
SMT
Alethe
integer arithmetic
Lambdapi
normal form
proof by reflection

Journal

F
FRONTIERS OF COMBINING SYSTEMS, FROCOS 2025
IF:
0
Papers:
21
Citations:
0

Organization

U
universite de lorraine
Scholars:
1.8W
Papers: 1.4W
Citations: 27