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

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

Abstract

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
2305.12926.pdf (338.21 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04315211 , version 1 (30-11-2023)

Licence

Identifiers

Cite

Martin Bromberger, Chaahat Jain, Christoph Weidenbach. SCL(FOL) Can Simulate Non-Redundant Superposition Clause Learning. Max-Planck-Institut für Informatik, Saarbrücken, Germany. 2023. ⟨hal-04315211⟩
9 View
6 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More