Learning Interpretable Heuristics for WalkSAT

Yannet Interian, Sara Bernardini

Local search algorithms are well-known methods for solving large, hard instances of the satisfiability problem (SAT). The performance of these algorithms crucially depends on heuri…