Relativization makes contradictions harder for Resolution

Dantchev, Stefan; Martin, Barnaby

Abstract

We provide a number of simplified and improved separations between pairs of Resolution-with-bounded-conjunction refutation systems, Res(d), as well as their tree-like versions, Res∗(d). The contradictions we use are natural combinatorial principles: the Least number principle, LNPn and an ordered variant thereof, the Induction principle, IPn. LNPn is known to be easy for Resolution. We prove that its relativization is hard for Resolution, and more generally, the relativization of LNPn iterated d times provides a separation between Res(d) and Res(d + 1). We prove the same result for the iterated relativization of IPn, where the tree-like variant Res∗(d) is considered instead of Res(d). We go on to provide separations between the parameterized versions of Res(1) and Res(2). Here we are able again to use the relativization of the LNPn, but the classical proof breaks down and we are forced to use an alternative. Finally, we separate the parameterized versions of Res∗(1) and Res∗(2). Here, the relativization of IPn will not work as it is, and so we make a vectorizing amendment to it in order to address this shortcoming.

Citation

Dantchev, S., & Martin, B. (2014). Relativization makes contradictions harder for Resolution. Annals of Pure and Applied Logic, 165(3), 837-857. https://doi.org/10.1016/j.apal.2013.10.009

• Journal Article Type: Article
• Acceptance Date: Oct 25, 2013
• Online Publication Date: Nov 15, 2013
• Publication Date: Mar 1, 2014
• Deposit Date: Dec 14, 2015
• Publicly Available Date: Jan 15, 2016
• Journal: Annals of Pure and Applied Logic
• Print ISSN: 0168-0072
• Publisher: Elsevier
• Peer Reviewed: Peer Reviewed
• Volume: 165
• Issue: 3
• Pages: 837-857
• DOI: https://doi.org/10.1016/j.apal.2013.10.009
• Keywords: Proof complexity, Lower bounds, Resolution-with-bounded-conjunction, Parameterized proof complexity.
• Public URL: https://durham-repository.worktribe.com/output/1416645