Simplified and Improved Separations Between Regular and General Resolution by Lifting
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-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 language | English |
---|---|
Title of host publication | Theory and Applications of Satisfiability Testing – SAT 2020 - 23rd International Conference, Proceedings |
Editors | Luca Pulina, Martina Seidl |
Publisher | Springer |
Publication date | 2020 |
Pages | 182-200 |
ISBN (Print) | 9783030518240 |
DOIs | |
Publication status | Published - 2020 |
Event | 23rd International Conference on Theory and Applications of Satisfiability Testing, SAT 2020 - Virtual, Online Duration: 3 Jul 2020 → 10 Jul 2020 |
Conference
Conference | 23rd International Conference on Theory and Applications of Satisfiability Testing, SAT 2020 |
---|---|
By | Virtual, Online |
Periode | 03/07/2020 → 10/07/2020 |
Series | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 12178 LNCS |
ISSN | 0302-9743 |
ID: 251867148