Simplified and Improved Separations Between Regular and General Resolution by Lifting

Marc Vinyals, Jan Elffers, Jan Johannsen, Jakob Nordström

Research output: Chapter in Book/Report/Conference proceedingPaper in conference proceedingpeer-review

Abstract

We give a significantly simplified proof of the exponential separation between regular and general resolution of Alekhnovich et al. (2007) as a consequence of a general theorem lifting proof depth to regular proof length in resolution. This simpler proof then allows us to strengthen the separation further, and to construct families of theoretically very easy benchmarks that are surprisingly hard for SAT solvers in practice.

Original languageEnglish
Title of host publicationTheory and Applications of Satisfiability Testing – SAT 2020
Subtitle of host publication23rd International Conference, Proceedings
EditorsLuca Pulina, Martina Seidl
PublisherSpringer
Pages182-200
Number of pages19
ISBN (Electronic)9783030518257
ISBN (Print)9783030518240
DOIs
Publication statusPublished - 2020
Event23rd International Conference on Theory and Applications of Satisfiability Testing, SAT 2020 - Virtual, Online
Duration: 2020 Jul 32020 Jul 10

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume12178
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference23rd International Conference on Theory and Applications of Satisfiability Testing, SAT 2020
CityVirtual, Online
Period2020/07/032020/07/10

Subject classification (UKÄ)

  • Computer Sciences

Cite this