Range-Restricted Interpolation through Clausal Tableaux
arXiv:2306.03572 · doi:10.1007/978-3-031-43513-3_1
Abstract
We show how variations of range-restriction and also the Horn property can be passed from inputs to outputs of Craig interpolation in first-order logic. The proof system is clausal tableaux, which stems from first-order ATP. Our results are induced by a restriction of the clausal tableau structure, which can be achieved in general by a proof transformation, also if the source proof is by resolution/paramodulation. Primarily addressed applications are query synthesis and reformulation with interpolation. Our methodical approach combines operations on proof structures with the immediate perspective of feasible implementation through incorporating highly optimized first-order provers.
arXiv commentExtended version of the TABLEAUX 2023 contribution; minor corrections
References in corpus (5)
- Beyond Quantifier-Free Interpolation in Extensions of Presburger Arithmetic (Extended Technical Report)
- Learning from Łukasiewicz and Meredith: Investigations into Proof Structures (Extended Version)
- Facets of the PIE Environment for Proving, Interpolating and Eliminating on the Basis of First-Order Logic
- Lemmas: Generation, Selection, Application
- Craig Interpolation with Clausal First-Order Tableaux