Simplified and Improved Separations Between Regular and General Resolution by Lifting

Publikation: Bidrag til bog/antologi/rapportKonferencebidrag i proceedingsForskningfagfællebedømt

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.

OriginalsprogEngelsk
TitelTheory and Applications of Satisfiability Testing – SAT 2020 - 23rd International Conference, Proceedings
RedaktørerLuca Pulina, Martina Seidl
ForlagSpringer
Publikationsdato2020
Sider182-200
ISBN (Trykt)9783030518240
DOI
StatusUdgivet - 2020
Begivenhed23rd International Conference on Theory and Applications of Satisfiability Testing, SAT 2020 - Virtual, Online
Varighed: 3 jul. 202010 jul. 2020

Konference

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

ID: 251867148