Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Cutting planes, connectivity, and threshold logic

Cutting planes, connectivity, and threshold logic Originating from work in operations research the cutting plane refutation systemCP 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 sizeCP proofs are given for the undirecteds-t connectivity principle. The subsystemsCP q ofCP, forq≥2, are shown to be polynomially equivalent toCP, thus answering problem 19 from the list of open problems of [8]. We present a normal form theorem forCP 2-proofs and thereby for arbitraryCP-proofs. As a corollary, we show that the coefficients and constant terms in arbitrary cutting plane proofs may be exponentially bounded by the number of steps in the proof, at the cost of an at most polynomial increase in the number of steps in the proof. The extensionCPLE +, introduced in [9] and there shown top-simulate Frege systems, is proved to be polynomially equivalent to Frege systems. Lastly, since linear inequalities are related to threshold gates, we introduce a new threshold logic and prove a completeness theorem. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Archive for Mathematical Logic Springer Journals

Cutting planes, connectivity, and threshold logic

Buss, Samuel; Clote, Peter
Archive for Mathematical Logic , Volume 35 (1) – May 25, 2005
Download PDF
30 pages

Loading next page...
 
/lp/springer-journals/cutting-planes-connectivity-and-threshold-logic-rI64gTBWRt

References (34)

Publisher
Springer Journals
Copyright
Copyright © 1996 by Springer-Verlag
Subject
Mathematics; Mathematical Logic and Foundations; Mathematics, general; Algebra
ISSN
0933-5846
eISSN
1432-0665
DOI
10.1007/BF01845704
Publisher site
See Article on Publisher Site

Abstract

Originating from work in operations research the cutting plane refutation systemCP 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 sizeCP proofs are given for the undirecteds-t connectivity principle. The subsystemsCP q ofCP, forq≥2, are shown to be polynomially equivalent toCP, thus answering problem 19 from the list of open problems of [8]. We present a normal form theorem forCP 2-proofs and thereby for arbitraryCP-proofs. As a corollary, we show that the coefficients and constant terms in arbitrary cutting plane proofs may be exponentially bounded by the number of steps in the proof, at the cost of an at most polynomial increase in the number of steps in the proof. The extensionCPLE +, introduced in [9] and there shown top-simulate Frege systems, is proved to be polynomially equivalent to Frege systems. Lastly, since linear inequalities are related to threshold gates, we introduce a new threshold logic and prove a completeness theorem.

Journal

Archive for Mathematical Logic – Springer Journals

Published: May 25, 2005

There are no references for this article.