@article{Buss1996CuttingPC,
title={Cutting planes, connectivity, and threshold logic},
author={Samuel R. Buss and Peter Clote},
journal={Arch. Math. Log.},
year={1996},
volume={35},
pages={33-62}
}

Originating from work in operations research the cutting plane refutation system CP is an extension of resolution, where unsatisfiable propositional logic formulas in conjunctive normal form are recognized by showing the non-existence of boolean solutions to associated families of linear inequalities. Polynomial size CP proofs are given for the undirected s-t connectivity principle. The subsystems CPq of CP , for q ≥ 2, are shown to be polynomially equivalent to CP , thus answering problem 19… CONTINUE READING