A Generic Deskolemization Strategy - Recherche en informatique (CRI)
 Accéder directement au contenu
Communication Dans Un Congrès Année : 2024

A Generic Deskolemization Strategy

Richard Bonichon
  • Fonction : Auteur
  • PersonId : 995846
Olivier Hermant

Résumé

In this paper, we present a general strategy that enables the translation of tableau proofs using different Skolemization rules into machine-checkable proofs. It is part of a framework that enables (i) instantiation of the strategy into algorithms for different sets of tableau rules (e.g., different logics) and (ii) easy soundness proof which relies on the local extensibility of user-defined rules. Furthermore, we propose an instantiation of this strategy for first-order tableaux that handles notably pre-inner Skolemization rules, which is, as far as the authors know, the first one in the literature. This deskolemization strategy has been implemented in the Goéland [17] automated theorem prover, enabling an export of its proofs to Coq [8] and Lambdapi [2]. Finally, we have evaluated the algorithm performances for inner and pre-inner Skolemization rules through the certification of proofs from some categories of the TPTP [39] library.
Fichier principal
Vignette du fichier
A-818.pdf (699.86 Ko) Télécharger le fichier
Origine Fichiers éditeurs autorisés sur une archive ouverte

Dates et versions

hal-04604646 , version 1 (17-06-2024)

Identifiants

Citer

Johann Rosain, Richard Bonichon, Julie Cailler, Olivier Hermant. A Generic Deskolemization Strategy. Proceedings of 25th Conference on Logic for Programming, Artificial Intelligence and Reasoning, May 2024, Balaclava, Mauritius. pp.246-263, ⟨10.29007/g1tm⟩. ⟨hal-04604646⟩
0 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More