Proof tree preserving tree interpolation
From MaRDI portal
Recommendations
Cites work
- Abstractions from proofs
- An interpolating sequent calculus for quantifier-free Presburger arithmetic
- An interpolating theorem prover
- Automated Deduction – CADE-20
- Complete instantiation-based interpolation
- Computer Aided Verification
- Cuts from Proofs: A Complete and Practical Technique for Solving Linear Inequalities over Integers
- Efficient Interpolant Generation in Satisfiability Modulo Theories
- From strong amalgamability to modularity of quantifier-free interpolation
- Inductive data flow graphs
- Interpolant strength
- Interpolation and SAT-based model checking.
- Lazy Abstraction with Interpolants
- Lower bounds for resolution and cutting plane proofs and monotone computations
- Nested interpolants
- On recursion-free Horn clauses and Craig interpolation
- Proof tree preserving interpolation
- Resolution proof transformation for compression and interpolation
- Simplification by Cooperating Decision Procedures
- Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory
- Tree Interpolation in Vampire
Cited in
(5)
This page was built for publication: Proof tree preserving tree interpolation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q286737)