arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2001.09398cs.AI
收藏

NLocalSAT:通过解预测增强局部搜索

NLocalSAT: Boosting Local Search with Solution Prediction

Peking University(北京大学);Institute of Software, Chinese Academy of Sciences(中国科学院软件研究所);University of Chinese Academy of Sciences(中国科学院大学)

Wenjie Zhang, Zeyu Sun, Qihao Zhu, Ge Li, Shaowei Cai, Yingfei Xiong, Lu Zhang

摘要:

布尔可满足性问题是计算机科学中著名的NP完全问题。随机局部搜索是求解可满足满足问题的一种有效方法。然而,在这种方法中,初始化是以随机的方式分配的,这影响了SLS求解器的有效性。为了解决这个问题,我们提出了NLocalSAT。NLocalSAT将SLS与解决方案预测模型相结合,该模型通过使用神经网络更改初始化分配来增强SLS。我们在五个SLS解算器(CCAnr,Sparrow,CPSparrow,YalSAT和probSAT)上评估了NLocalSAT,并在2018年SAT竞赛的随机轨道上进行了实例。实验结果表明,使用NLocalSAT的求解器比原SLS求解器的性能提高了27% ~ 62%.

英文摘要:

The Boolean satisfiability problem (SAT) is a famous NP-complete problem in computer science. An effective way for solving a satisfiable SAT problem is the stochastic local search (SLS). However, in this method, the initialization is assigned in a random manner, which impacts the effectiveness of SLS solvers. To address this problem, we propose NLocalSAT. NLocalSAT combines SLS with a solution prediction model, which boosts SLS by changing initialization assignments with a neural network. We evaluated NLocalSAT on five SLS solvers (CCAnr, Sparrow, CPSparrow, YalSAT, and probSAT) with instances in the random track of SAT Competition 2018. The experimental results show that solvers with NLocalSAT achieve 27% ~ 62% improvement over the original SLS solvers.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑