Popularity-similarity random SAT formulas

摘要

In the last decades, we have witnessed a remarkable success of algorithms solving the Boolean Satisfiability problem (SAT) on instances encoding application or real-world problems arising from a very diverse number of domains, such as hardware and software verification, planning or cryptography. These algorithms are the so known Conflict-Driven Clause Learning (CDCL) SAT solvers. Interestingly enough, the reasons for the success of these solvers on this diverse range of problems are not completely understood yet.