Discovering heuristics in a complex SAT solver with large language models

Yiwen Sun, Furong Ye, Zhihan Chen +2

The Satisfiability problem (SAT) is fundamental in computational complexity theory and has a wide range of industrial applications. Optimizing modern SAT solvers in real-world sett…