A Comprehensive Framework for Saturation Theorem Proving - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Automated Reasoning Year : 2022

A Comprehensive Framework for Saturation Theorem Proving

Abstract

A crucial operation of saturation theorem provers is deletion of subsumed formulas. Designers of proof calculi, however, usually discuss this only informally, and the rare formal expositions tend to be clumsy. This is because the equivalence of dynamic and static refutational completeness holds only for derivations where all deleted formulas are redundant, but the standard notion of redundancy is too weak: A clause C does not make an instance $$C\sigma $$ C σ redundant. We present a framework for formal refutational completeness proofs of abstract provers that implement saturation calculi, such as ordered resolution and superposition. The framework modularly extends redundancy criteria derived via a familiar ground-to-nonground lifting. It allows us to extend redundancy criteria so that they cover subsumption, and also to model entire prover architectures so that the static refutational completeness of a calculus immediately implies the dynamic refutational completeness of a prover implementing the calculus within, for instance, an Otter or DISCOUNT loop. Our framework is mechanized in Isabelle/HOL.
Fichier principal
Vignette du fichier
jour.pdf (377.11 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03909983 , version 1 (21-12-2022)

Licence

Attribution

Identifiers

Cite

Uwe Waldmann, Sophie Tourret, Simon Robillard, Jasmin Blanchette. A Comprehensive Framework for Saturation Theorem Proving. Journal of Automated Reasoning, 2022, 66 (4), pp.499-539. ⟨10.1007/s10817-022-09621-7⟩. ⟨hal-03909983⟩
32 View
12 Download

Altmetric

Share

Gmail Facebook X LinkedIn More