Prioritized Unit Propagation with Periodic Resetting is (Almost) All You Need for Random SAT Solving
This addresses the challenge of solving hard random SAT instances for the SAT community, though it is incremental as it builds on existing unit propagation methods.
The authors tackled the problem of solving hard random SAT instances by proposing prioritized unit propagation with periodic resetting, achieving second place in the Random Track of the 2017 and 2018 SAT competitions with a basic prototype.
We propose prioritized unit propagation with periodic resetting, which is a simple but surprisingly effective algorithm for solving random SAT instances that are meant to be hard. In particular, an evaluation on the Random Track of the 2017 and 2018 SAT competitions shows that a basic prototype of this simple idea already ranks at second place in both years. We share this observation in the hope that it helps the SAT community better understand the hardness of random instances used in competitions and inspire other interesting ideas on SAT solving.