An Isabelle/HOL Formalization of the SCL(FOL) Calculus - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2023

An Isabelle/HOL Formalization of the SCL(FOL) Calculus

Abstract

We present an Isabelle/HOL formalization of Simple Clause Learning for first-order logic without equality: SCL(FOL). The main results are formal proofs of soundness, non-redundancy of learned clauses, termination, and refutational completeness. Compared to the unformalized version, the formalized calculus is simpler and more general, some results such as non-redundancy are stronger and some results such as non-subsumption are new. We found one bug in a previously published version of the SCL Backtrack rule. Compared to related formalizations, we introduce a new technique for showing termination based on non-redundant clause learning.
Fichier principal
Vignette du fichier
978-3-031-38499-8_7.pdf (425.51 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04313741 , version 1 (29-11-2023)

Licence

Identifiers

Cite

Martin Bromberger, Martin Desharnais, Christoph Weidenbach. An Isabelle/HOL Formalization of the SCL(FOL) Calculus. Automated Deduction - {CADE} 29 - 29th International Conference on Automated Deduction, Jul 2023, Rome (IT), Italy. pp.116-133, ⟨10.1007/978-3-031-38499-8_7⟩. ⟨hal-04313741⟩
20 View
4 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More