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

用于SAT的机器学习:受限启发式算法与新型图表示

Machine Learning for SAT: Restricted Heuristics and New Graph Representations

St. Petersburg State University(圣彼得堡国立大学);Steklov Institute of Mathematics at St. Petersburg(圣彼得堡斯捷克洛夫数学研究所)

Mikhail Shirokikh, Ilya Shenbin, Anton Alekseev, Sergey Nikolenko

AI总结:

针对机器学习改进SAT求解启发式时存在的运行慢问题,提出先用ML模型执行初始步再交回控制权的策略,还改进了适配跨领域SAT的Graph-Q-SAT,经随机和工业算例验证可行。

摘要:

布尔可满足性问题(SAT)是一个基础的NP完全问题,在自动规划与调度等领域有诸多应用。为求解大规模算例,SAT求解器必须依赖启发式方法,例如在DPLL和CDCL求解器中选择分支变量。这类启发式方法可通过机器学习(ML)模型得到改进;它们能减少求解步数,但通常会拖慢运行时间,因为有效的模型往往规模较大、运算较慢。我们提出一种策略:先用训练好的ML模型执行初始的若干步,再将控制权交还给经典启发式算法;这简化了SAT求解的冷启动过程,可同时减少求解步数和总运行时间,但需要单独决策何时将控制权交还给求解器。此外,我们针对从其他领域(例如开放车间调度问题)转化而来的SAT问题,对Graph-Q-SAT进行了适配性改进。我们在随机SAT问题和工业SAT问题上验证了所提方法的可行性。

英文摘要:

Boolean satisfiability (SAT) is a fundamental NP-complete problem with many applications, including automated planning and scheduling. To solve large instances, SAT solvers have to rely on heuristics, e.g., choosing a branching variable in DPLL and CDCL solvers. Such heuristics can be improved with machine learning (ML) models; they can reduce the number of steps but usually hinder the running time because useful models are relatively large and slow. We suggest the strategy of making a few initial steps with a trained ML model and then releasing control to classical heuristics; this simplifies cold start for SAT solving and can decrease both the number of steps and overall runtime, but requires a separate decision of when to release control to the solver. Moreover, we introduce a modification of Graph-Q-SAT tailored to SAT problems converted from other domains, e.g., open shop scheduling problems. We validate the feasibility of our approach with random and industrial SAT problems.

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

↑