2023/05/22 by Martin Bromberger, Bromberger, Martin, Chaahat Jain +3
Computer Science · #Artificial Intelligence (cs.AI) #FOS: Computer and information sciences #I.2.3 #Logic in Computer Science (cs.LO) #Logic, Reasoning, and Knowledge #Natural Language Processing Techniques #Symbolic Computation (cs.SC) #Topic Modeling
paper · pdf · doi:10.48550/arxiv.2305.12926
openalex publication_date 2023/05/22 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We show that SCL(FOL) can simulate the derivation of non-redundant 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.