Verified Given Clause Procedures - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2023

Verified Given Clause Procedures


Resolution and superposition provers rely on the given clause procedure to saturate clause sets. Using Isabelle/HOL, we formally verify four variants of the procedure: the well-known Otter and DISCOUNT loops as well as the newer iProver and Zipperposition loops. For each of the variants, we show that the procedure guarantees saturation, given a fair data structure to store the formulas that wait to be selected. Our formalization of the Zipperposition loop clarifies some fine points previously misunderstood in the literature.
Fichier principal
Vignette du fichier
paper (1).pdf (444.75 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

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




Jasmin Blanchette, Qi Qiu, Sophie Tourret. Verified Given Clause Procedures. CADE-29, 2023, Rome, Italy. pp.61-77, ⟨10.1007/978-3-031-38499-8_4⟩. ⟨hal-04298505⟩
15 View
11 Download



Gmail Mastodon Facebook X LinkedIn More