A Verified Prover Based on Ordered Resolution - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

A Verified Prover Based on Ordered Resolution

Abstract

The superposition calculus, which underlies first-order theorem provers such as E, SPASS, and Vampire, combines ordered resolution and equality reasoning. As a step towards verifying modern provers, we specify, using Isabelle/HOL, a purely functional first-order ordered resolution prover and establish its soundness and refutational completeness. Methodologically, we apply stepwise refinement to obtain, from an abstract nondeterministic specification, a verified de-terministic program, written in a subset of Isabelle/HOL from which we extract purely functional Standard ML code that constitutes a semidecision procedure for first-order logic.
Fichier principal
Vignette du fichier
paper.pdf (623.66 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01937141 , version 1 (27-11-2018)

Identifiers

Cite

Anders Schlichtkrull, Jasmin Christian Blanchette, Dmitriy Traytel. A Verified Prover Based on Ordered Resolution. CPP 2019 - The 8th ACM SIGPLAN International Conference on Certified Programs and Proofs, Jan 2019, Cascais, Portugal. ⟨10.1145/3293880.3294100⟩. ⟨hal-01937141⟩
77 View
135 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More