The Silent (R)evolution of SAT.

The article explores Propositional Satisfiability (SAT), described by the authors as a cornerstone of computational complexity theory. Particular focus is given to how it has become a central target problem for solving hard computational problems in practice. Other topics discussed include how initial progress was made in SAT solving in the early 1990s and details on other eras of practical SAT solving.