Simplified and Improved Separations Between Regular and General Resolution by Lifting

Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

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 - 23rd International Conference, Proceedings
EditorsLuca Pulina, Martina Seidl
PublisherSpringer
Publication date2020
Pages182-200
ISBN (Print)9783030518240
DOIs
Publication statusPublished - 2020
Event23rd International Conference on Theory and Applications of Satisfiability Testing, SAT 2020 - Virtual, Online
Duration: 3 Jul 202010 Jul 2020

Conference

Conference23rd International Conference on Theory and Applications of Satisfiability Testing, SAT 2020
ByVirtual, Online
Periode03/07/202010/07/2020
SeriesLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume12178 LNCS
ISSN0302-9743

ID: 251867148