Log In Sign Up

Splitting Proofs for Interpolation

by   Bernhard Gleiss, et al.

We study interpolant extraction from local first-order refutations. We present a new theoretical perspective on interpolation based on clearly separating the condition on logical strength of the formula from the requirement on the com- mon signature. This allows us to highlight the space of all interpolants that can be extracted from a refutation as a space of simple choices on how to split the refuta- tion into two parts. We use this new insight to develop an algorithm for extracting interpolants which are linear in the size of the input refutation and can be further optimized using metrics such as number of non-logical symbols or quantifiers. We implemented the new algorithm in first-order theorem prover VAMPIRE and evaluated it on a large number of examples coming from the first-order proving community. Our experiments give practical evidence that our work improves the state-of-the-art in first-order interpolation.


page 1

page 2

page 3

page 4


On an optimal interpolation formula in K_2(P_2) space

The paper is devoted to the construction of an optimal interpolation for...

Uniform Interpolation in Coalgebraic Modal Logic

A logic has uniform interpolation if its formulas can be projected down ...

Trakhtenbrot's Theorem in Coq, A Constructive Approach to Finite Model Theory

We study finite first-order satisfiability (FSAT) in the constructive se...

A New First Order Taylor-like Theorem With An Optimized Reduced Remainder

This paper is devoted to a new first order Taylor-like formula where the...

Probabilistic Theorem Proving

Many representation schemes combining first-order logic and probability ...

Craig Interpolation and Access Interpolation with Clausal First-Order Tableaux

We show methods to extract Craig-Lyndon interpolants and access interpol...

Learning Symmetric Rules with SATNet

SATNet is a differentiable constraint solver with a custom backpropagati...