Advertisement

Cutting Plane Proofs

  • Stasys Jukna
Chapter
Part of the Algorithms and Combinatorics book series (AC, volume 27)

Abstract

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.

Keywords

Linear Inequality Proof System Integer Solution Division Rule Rational Polyhedron 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Institute of InformaticsUniversity of FrankfurtFrankfurt am MainGermany
  2. 2.Institute of Mathematics and InformaticsVilnius UniversityVilniusLithuania

Personalised recommendations