Hard examples for resolution

A Urquhart - Journal of the ACM (JACM), 1987 - dl.acm.org
Exponential lower bounds are proved for the length-of-resolution refutations of sets of
disjunctions constructed from expander graphs, using the method of Tseitin. Since these …

On the complexity of cutting-plane proofs

W Cook, CR Coullard, G Turán - Discrete Applied Mathematics, 1987 - Elsevier
As introduced by Chvátal, cutting planes provide a canonical way of proving that every
integral solution of a given system of linear inequalities satisfies another specified inequality …

Polynomial size proofs of the propositional pigeonhole principle

SR Buss - The Journal of Symbolic Logic, 1987 - cambridge.org
Cook and Reckhow defined a propositional formulation of the pigeonhole principle. This
paper shows that there are Frege proofs of this propositional pigeonhole principle of …

[PDF][PDF] Gy. TURÁN

W COOK, CR COULLARD - Discrete Applied Mathematics, 1987 - math.uwaterloo.ca
An attractive way of looking at Gomory's cutting plane technique [13] was intro-duced by
Chvátal [5]. The point of view is that cutting planes provide a canonical way of proving that …

[引用][C] Automatic theorem proving. II

AA Voronkov, AI Degtyarev - Cybernetics, 1987 - Springer
In Part I of the survey we highlighted the main stages in the development of methods of
automatic theorem proving, identified a number of directions that merit special attention, and …