.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Machine learning (ML)
Boolean satisfiability (SAT)
deep learning
graph neural networks (GNNs)
combinatorial optimization
期刊
IF:
8.7
论文数:
312
被引数:
1.4K
机构
引用论文
.png){kind=icon}
A scoping review on the field validation and implementation of rapid diagnostic tests for vector-borne and other infectious diseases of poverty in urban areas对城市地区媒介传播和其他贫困传染病的快速诊断测试的现场验证和实施的范围界定审查
OAAI
OAAI分享收藏分享收藏
查看更多内容