On the completeness of interpolation algorithms
From MaRDI portal
Cites work
- Abstracting induction by extrapolation and interpolation
- Computer Aided Verification
- Constructing Craig interpolation formulas
- Cooperation of background reasoners in theory reasoning by residue sharing
- Handbook of proof theory
- scientific article; zbMATH DE number 5539366 (Why is no real title available?)
- scientific article; zbMATH DE number 1497485 (Why is no real title available?)
- scientific article; zbMATH DE number 3249766 (Why is no real title available?)
- scientific article; zbMATH DE number 3085803 (Why is no real title available?)
- Interpolant strength
- Interpolant strength revisited
- Interpolant-Based Transition Relation Approximation
- Interpolation and model checking
- Interpolation and Symbol Elimination
- Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic
- Introduction: Interpolations -- essays in honor of William Craig
- Lower bounds for resolution and cutting plane proofs and monotone computations
- Lower bounds to the size of constant-depth propositional proofs
- Mathematical Logic and Computation
- Methods of cut-elimination
- Partition-based logical reasoning for first-order and propositional theories
- Playing in the grey area of proofs
- Proof theory. 2nd ed
- Simplification by Cooperating Decision Procedures
- Three uses of the Herbrand-Gentzen theorem in relating model theory and proof theory
- Tools and Algorithms for the Construction and Analysis of Systems
- Towards a clausal analysis of cut-elimination
This page was built for publication: On the completeness of interpolation algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6970230)
