Skip to Main content Skip to Navigation
Conference papers

A Comprehensive Framework for Saturation Theorem Proving

Abstract : We present a framework for formal refutational completeness proofs of abstract provers that implement saturation calculi, such as ordered resolution or superposition. The framework relies on modular extensions of lifted redundancy criteria. It allows us to extend redundancy criteria so that they cover subsumption, and also to model entire prover architectures in such a way that the static refutational completeness of a calculus immediately implies the dynamic refutational completeness of a prover implementing the calculus, for instance within an Otter or DISCOUNT loop. Our framework is mechanized in Isabelle/HOL.
Document type :
Conference papers
Complete list of metadata
Contributor : Jasmin Blanchette Connect in order to contact the contributor
Submitted on : Monday, January 11, 2021 - 4:15:46 PM
Last modification on : Wednesday, December 1, 2021 - 10:32:07 AM
Long-term archiving on: : Monday, April 12, 2021 - 7:11:20 PM


Files produced by the author(s)



Uwe Waldmann, Sophie Tourret, Simon Robillard, Jasmin Blanchette. A Comprehensive Framework for Saturation Theorem Proving. IJCAR 2020 (Part I) International Joint Conference on Automated Reasoning, Jun 2020, Paris, France. pp.316-334, ⟨10.1007/978-3-030-51074-9_18⟩. ⟨hal-03106208⟩



Les métriques sont temporairement indisponibles