Core Concepts
Refinement and proof of soundness, completeness, and clause learning guarantees in SCL(FOL).
Abstract
The paper revisits the SCL calculus for first-order logic without equality, focusing on regularity, termination guarantees, and model bounding. It presents rigorous proofs for soundness, completeness, and clause learning guarantees. Various methods for first-order reasoning are compared.
Structure:
Introduction to First-Order Automated Theorem Proving
Importance of First-Order Logic in Reasoning
Traditional Methods: Resolution and Superposition
Model-Based Approaches: Model-Evolution Calculus and NRCL
Overview of SCL Calculus and its Extensions
Key Highlights:
Incorporation of stronger regularity into SCL(FOL)
Introduction of trail and model bounding for termination guarantees
Proof of soundness, completeness, and non-redundant clause learning in SCL(FOL)
Stats
19 Mar 2024: Paper arXiv:2302.05954v2 [cs.LO]
March 20, 2024: Presentation date at Max Planck Institute for Informatics