SCL(FOL) Can Simulate Non-Redundant Superposition Clause Learning - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2023

SCL(FOL) Can Simulate Non-Redundant Superposition Clause Learning


We show that SCL(FOL) can simulate the derivation of nonredundant clauses by superposition for first-order logic without equality. Superposition-based reasoning is performed with respect to a fixed reduction ordering. The completeness proof of superposition relies on the grounding of the clause set. It builds a ground partial model according to the fixed ordering, where minimal false ground instances of clauses then trigger non-redundant superposition inferences. We define a respective strategy for the SCL calculus such that clauses learned by SCL and superposition inferences coincide. From this perspective the SCL calculus can be viewed as a generalization of the superposition calculus.
Fichier principal
Vignette du fichier
978-3-031-38499-8_8.pdf (366.46 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

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




Martin Bromberger, Chaahat Jain, Christoph Weidenbach. SCL(FOL) Can Simulate Non-Redundant Superposition Clause Learning. Automated Deduction - {CADE} 29 - 29th International Conference on Automated Deduction, Jul 2023, Rome (IT), Italy. pp.134 - 152, ⟨10.1007/978-3-031-38499-8_8⟩. ⟨hal-04313799⟩
20 View
7 Download



Gmail Mastodon Facebook X LinkedIn More