Range-Restricted Interpolation through Clausal Tableaux

06/06/2023
by   Christoph Wernhard, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/21/2023

Extensions of K5: Proof Theory and Uniform Lyndon Interpolation

We introduce a Gentzen-style framework, called layered sequent calculi, ...
research
04/17/2023

Craig Interpolation for Guarded Fragments

We show that the guarded-negation fragment (GNFO) is, in a precise sense...
research
11/28/2016

Blocking and Other Enhancements for Bottom-Up Model Generation Methods

Model generation is a problem complementary to theorem proving and is im...
research
10/17/2019

Glueability of resource proof-structures: inverting the Taylor expansion (long version)

A Multiplicative-Exponential Linear Logic (MELL) proof-structure can be ...
research
08/06/2020

Gluing resource proof-structures: inhabitation and inverting the Taylor expansion

A Multiplicative-Exponential Linear Logic (MELL) proof-structure can be ...
research
05/23/2021

Uniform interpolation via nested sequents and hypersequents

A modular proof-theoretic framework was recently developed to prove Crai...

Please sign up or login with your details

Forgot password? Click here to reset