Cutting Plane Proofs
We now turn our attention to a proof system more powerful than resolution—the so-called cutting plane proof system. This proof system, which can be viewed as a “geometric generalization” of resolution, originated in works on integer programming by Gomory (1963) and Chvátal (1973); as a proof system it was first considered in Cook et al. (1987) The basic idea is to use a few elementary rules to prove that a given system of linear inequalities (or “cutting planes”) with integer coefficients does not have a 0-1 solution.
KeywordsLinear Inequality Proof System Integer Solution Division Rule Rational Polyhedron
Unable to display preview. Download preview PDF.