Superposition for Higher-Order Logic - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Article Dans Une Revue Journal of Automated Reasoning Année : 2023

Superposition for Higher-Order Logic

Résumé

We recently designed two calculi as stepping stones towards superposition for full higher-order logic: Boolean-free λ-superposition and superposition for first-order logic with interpreted Booleans. Stepping on these stones, we finally reach a sound and refutationally complete calculus for higher-order logic with polymorphism, extensionality, Hilbert choice, and Henkin semantics. In addition to the complexity of combining the calculus's two predecessors, new challenges arise from the interplay between λ-terms and Booleans. Our implementation in Zipperposition outperforms all other higher-order theorem provers and is on a par with an earlier, pragmatic prototype of Booleans in Zipperposition.
Fichier principal
Vignette du fichier
paper.pdf (504.28 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04298616 , version 1 (21-11-2023)

Licence

Identifiants

Citer

Alexander Bentkamp, Jasmin Blanchette, Sophie Tourret, Petar Vukmirović. Superposition for Higher-Order Logic. Journal of Automated Reasoning, 2023, 67 (1), pp.10. ⟨10.1007/s10817-022-09649-9⟩. ⟨hal-04298616⟩
23 Consultations
15 Téléchargements

Altmetric

Partager

Gmail Mastodon Facebook X LinkedIn More