SCL(FOL) Revisited - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2023

SCL(FOL) Revisited

Abstract

This paper presents an up-to-date and refined version of the SCL calculus for first-order logic without equality. The refinement mainly consists of the following two parts: First, we incorporate a stronger notion of regularity into SCL(FOL). Our regularity definition is adapted from the SCL(T) calculus. This adapted definition guarantees non-redundant clause learning during a run of SCL. However, in contrast to the original presentation, it does not require exhaustive propagation. Second, we introduce trail and model bounding to achieve termination guarantees. In previous versions, no termination guarantees about SCL were achieved. Last, we give rigorous proofs for soundness, completeness and clause learning guarantees of SCL(FOL) and put SCL(FOL) into context of existing first-order calculi.
Fichier principal
Vignette du fichier
2302.05954.pdf (231.55 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

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

Licence

Attribution

Identifiers

Cite

Martin Bromberger, Simon Schwarz, Christoph Weidenbach. SCL(FOL) Revisited. Max-Planck-Institut für Informatik, Saarbrücken, Germany. 2023. ⟨hal-04314223⟩
11 View
3 Download

Altmetric

Share

Gmail Facebook X LinkedIn More