Jan 23, 2007 · In this note we observe further consequences of the interpolant having short circuit descriptions, namely that UP ⊆ P/poly, and that every ...

Home · Geoinformatics · Interpolation. ArticlePDF Available. A note on the size of Craig Interpolants. January 2006. Authors: Uwe Schöning at Ulm University.

A lower bound for the complexity of Craig's interpolants in sentential logic · Mathematics. Arch. Math. Log. · 1983.

Apr 23, 2007 · A note on the size of Craig Interpolants. Authors Uwe Schöning, Jacobo Torán. Part of: Volume: Dagstuhl Seminar Proceedings, Volume 6451. Part ...

2008. In this thesis, we present some results in computational complexity. We consider two approaches for showing that #P has polynomial-size circuits.

The proof given above for Theorem 5 is constructive: it tells us how to find a Craig interpolant for P → Q. However, because the size of this interpolant may be ...

Missing: note size

They did not attempt to reduce the size of interpolants; rather, they suggested repeated trials of. Craig Interpolation with different support sets. They ...

This paper gives an eifi- cient method for constructing a Craig interpolant from a refutation proof which involves binary resolution, paramodulation, and ...

Finally, we note that it should also be possible to extract bounds on the size of the interpolant for a consecution, given bounds on the size of its cut-free ...