AI RESEARCH
Using deep learning to construct stochastic local search SAT solvers with performance bounds
arXiv CS.AI
•
ArXi:2309.11452v3 Announce Type: replace The Boolean Satisfiability problem (SAT), as the prototypical $\mathsf{NP}$-complete problem, is crucial in both theoretical computer science and practical applications. To address this problem, stochastic local search (SLS) algorithms, which iteratively and randomly update candidate assignments, present an important and theoretically well-studied class of solvers.