Cookies

We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.


Durham e-Theses
You are in:

Rank Lower Bounds in Propositional Proof Systems Based on Integer Linear Programming Methods

RHODES, MARK,NICHOLASCHARLES (2009) Rank Lower Bounds in Propositional Proof Systems Based on Integer Linear Programming Methods. Doctoral thesis, Durham University.

[img]
Preview
PDF
809Kb

Abstract

The work of this thesis is in the area of proof complexity, an area which looks to uncover the limitations of proof systems. In this thesis we investigate the rank complexity of tautologies for several of the most important proof systems based on integer linear programming methods. The three main contributions of this thesis are as follows:

Firstly we develop the first rank lower bounds for the proof system based on
the Sherali-Adams operator and show that both the Pigeonhole and Least Number Principles require linear rank in this system. We also demonstrate a link between the complexity measures of Sherali-Adams rank and Resolution width.

Secondly we present a novel method for deriving rank lower bounds in the well-studied Cutting Planes proof system. We use this technique to show that the Cutting Plane rank of the Pigeonhole Principle is logarithmic. Finally we separate the complexity measures of Resolution width and Sherali-Adams rank from the complexity measures of Lovasz and Schrijver rank and Cutting Planes rank.

Item Type:Thesis (Doctoral)
Award:Doctor of Philosophy
Keywords:Proof System, Rank Lower Bounds, Sherali-Adams, Cutting Planes, Lovasz-Schrijver.
Faculty and Department:Faculty of Science > Engineering and Computing Science, School of
Thesis Date:2009
Copyright:Copyright of this thesis is held by the author
Deposited On:26 Apr 2010 14:44

Social bookmarking: del.icio.usConnoteaBibSonomyCiteULikeFacebookTwitter