Cutting planes, connectivity, and threshold logic

@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
Highly Cited
This paper has 31 citations. REVIEW CITATIONS

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Cuting Plane Versus Frege Proof Systems

CSL • 1990
View 10 Excerpts
Highly Influenced

The Intractability of Resolution

Theor. Comput. Sci. • 1985
View 4 Excerpts
Highly Influenced

On Frege and Extended Frege Proof Systems

Jan Kraj, I Cek
1993
View 3 Excerpts
Highly Influenced

On the complexity of cutting-plane proofs

Discrete Applied Mathematics • 1987
View 4 Excerpts
Highly Influenced

Threshold logic proof systems

S. Buss, P. Clote
Manuscript, May • 1995
View 1 Excerpt

Similar Papers

Loading similar papers…