@inproceedings{ee6456fa7b9d4d738d530c0ceabe67da,
title = "Semantic versus syntactic cutting planes",
abstract = "In this paper, we compare the strength of the semantic and syntactic version of the cutting planes proof system. First, we show that the lower bound technique of Pudl{\'a}k applies also to semantic cutting planes: the proof system has feasible interpolation via monotone real circuits, which gives an exponential lower bound on lengths of semantic cutting planes refutations. Second, we show that semantic refutations are stronger than syntactic ones. In particular, we give a formula for which any refutation in syntactic cutting planes requires exponential length, while there is a polynomial length refutation in semantic cutting planes. In other words, syntactic cutting planes does not p-simulate semantic cutting planes. We also give two incompatible integer inequalities which require exponential length refutation in syntactic cutting planes.",
keywords = "Cutting planes, Lower bounds, Proof complexity",
author = "Yuval Filmus and Pavel Hrube{\v s} and Massimo Lauria",
note = "Publisher Copyright: {\textcopyright} Yuval Filmus, Pavel Hrube{\v s}, and Massimo Lauria; licensed under Creative Commons License CC-BY.; 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016 ; Conference date: 17-02-2016 Through 20-02-2016",
year = "2016",
month = feb,
day = "1",
doi = "https://doi.org/10.4230/LIPIcs.STACS.2016.35",
language = "الإنجليزيّة",
series = "Leibniz International Proceedings in Informatics, LIPIcs",
editor = "Heribert Vollmer and Nicolas Ollinger",
booktitle = "33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016",
}