Theorem Proving as Constraint Solving with Coherent Logic - Ecole Nationale du Génie de l'Eau et de l'Environnement de Strasbourg Accéder directement au contenu
Article Dans Une Revue Journal of Automated Reasoning Année : 2022

Theorem Proving as Constraint Solving with Coherent Logic

Predrag Janičić
  • Fonction : Auteur
  • PersonId : 864213

Résumé

In contrast to common automated theorem proving approaches, in which the search space is a set of some formulae and what is sought is again a (goal) formula, we propose an approach based on searching for a proof (of a given length) as a whole. Namely, a proof of a formula in a fixed logical setting can be encoded as a sequence of natural numbers meeting some conditions and a suitable constraint solver can find such a sequence. The sequence can then be decoded giving a proof in the original theory language. This approach leads to several unique features, for instance, it can provide shortest proofs. In this paper, we focus on proofs in coherent logic, an expressive fragment of first-order logic, and on SAT and SMT solvers for solving sets of constraints, but the approach could be tried in other contexts as well. We implemented the proposed method and we present its features, perspectives and performances. One of the features of the implemented prover is that it can generate human understandable proofs in natural language and also machine-verifiable proofs for the interactive prover Coq.
Fichier principal
Vignette du fichier
TheoremProvingAsConstraintSolvingAuthorVersion.pdf (640.12 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03632665 , version 1 (06-10-2023)

Identifiants

Citer

Predrag Janičić, Julien Narboux. Theorem Proving as Constraint Solving with Coherent Logic. Journal of Automated Reasoning, 2022, 66 (4), pp.689-746. ⟨10.1007/s10817-022-09629-z⟩. ⟨hal-03632665⟩
63 Consultations
33 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More