Extending a brainiac prover to lambda-free higher-order logic - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue International Journal on Software Tools for Technology Transfer Année : 2022

Extending a brainiac prover to lambda-free higher-order logic

Résumé

Decades of work have gone into developing efficient proof calculi, data structures, algorithms, and heuristics for first-order automatic theorem proving. Higher-order provers lag behind in terms of efficiency. Instead of developing a new higher-order prover from the ground up, we propose to start with the state-of-the-art superposition prover E and gradually enrich it with higher-order features. We explain how to extend the prover’s data structures, algorithms, and heuristics to λ -free higher-order logic, a formalism that supports partial application and applied variables. Our extension outperforms the traditional encoding and appears promising as a stepping stone toward full higher-order logic.
Fichier principal
Vignette du fichier
paper.pdf (359.5 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03814641 , version 1 (14-10-2022)

Identifiants

Citer

Petar Vukmirović, Jasmin Blanchette, Simon Cruanes, Stephan Schulz. Extending a brainiac prover to lambda-free higher-order logic. International Journal on Software Tools for Technology Transfer, 2022, 24 (1), pp.67-87. ⟨10.1007/s10009-021-00639-7⟩. ⟨hal-03814641⟩
43 Consultations
32 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More