.png){kind=icon}
Return
Machine Learning Methods in Solving the Boolean Satisfiability Problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s11633-022-1396-2.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper reviews the recent literature on solving the Boolean satisfiability problem (SAT), an archetypal NP-complete problem, with the aid of machine learning (ML) techniques. Over the last decade, the machine learning society advances rapidly and surpasses human performance on several tasks. This trend also inspires a number of works that apply machine learning methods for SAT solving. In this survey, we examine the evolving ML SAT solvers from naive classifiers with handcrafted features to emerging end-to-end SAT solvers, as well as recent progress on combinations of existing conflict-driven clause learning (CDCL) and local search solvers with machine learning methods. Overall, solving SAT with machine learning is a promising yet challenging research topic. We conclude the limitations of current works and suggest possible future directions. The collected paper list is available at https://github.com/ThinklabSJTU/awesome-ml4co.
Keywords:
Machine learning (ML)
Boolean satisfiability (SAT)
deep learning
graph neural networks (GNNs)
combinatorial optimization
Journal
IF:
8.7
Papers:
312
Citations:
1.4K
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
View more