Learning Local Search Heuristics for Boolean Satisfiability

The problems of interest are often NP-complete and traditional methods efficient in practice usually rely on heuristics or produce approximate solutions.