Simplified and Improved Separations Between Regular and General Resolution by Lifting

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

Forskningsoutput: Kapitel i bok/rapport/Conference proceedingKonferenspaper i proceedingPeer review

Sammanfattning

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.

Originalspråkengelska
Titel på värdpublikationTheory and Applications of Satisfiability Testing – SAT 2020
Undertitel på värdpublikation23rd International Conference, Proceedings
RedaktörerLuca Pulina, Martina Seidl
FörlagSpringer
Sidor182-200
Antal sidor19
ISBN (elektroniskt)9783030518257
ISBN (tryckt)9783030518240
DOI
StatusPublished - 2020
Evenemang23rd International Conference on Theory and Applications of Satisfiability Testing, SAT 2020 - Virtual, Online
Varaktighet: 2020 juli 32020 juli 10

Publikationsserier

NamnLecture Notes in Computer Science
FörlagSpringer
Volym12178
ISSN (tryckt)0302-9743
ISSN (elektroniskt)1611-3349

Konferens

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

Ämnesklassifikation (UKÄ)

  • Datavetenskap (datalogi)

Citera det här