[Proof Complexity] SAT solving and proof complexity survey chapter

[Jakob Nordström]

Dear colleagues,

This is just to let you know that Sam Buss and yours truly have recently submitted our survey chapter on proof complexity and SAT solving for the 2nd edition of the Handbook of Satisfiability.

According to what the editors say, the handbook should be out sometime in 2021, but you can find our chapter already now at http://www.csc.kth.se/~jakobn/research/ProofComplexityChapter.pdf.

In addition to providing discussions of and references for some of the most recent exciting developments in proof complexity (but unfortunately missing out on some others due to space constraints --- our apologies), we hope that this survey chapter can also serve to stimulate an increased interaction between theoreticians and practitioners working on the SAT problem. There should be lots of room for establishing rigorous results regarding many of the questions SAT practitioners are currently thinking about, and it also seems quite possible that some of the work on the theory side on studying efficient methods of reasoning could be converted into algorithmic improvements of current state-of-the-art SAT solvers.

Best regards,
Jakob Nordström

Jakob Nordström, Professor
University of Copenhagen and Lund University
Phone: +46 70 742 21 98
http://www.csc.kth.se/~jakobn/ (webpages still in transit)