arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2107.07116cs.NEcs.AIcs.LG
收藏

基于转换器的机器学习快速SAT求解器和逻辑综合

Transformer-based Machine Learning for Fast SAT Solvers and Logic Synthesis

University of California Los Angeles(加利福尼亚大学洛杉矶分校);The Pennsylvania State University(宾夕法尼亚州立大学);University of Virginia(弗吉尼亚大学)

Feng Shi, Chonghan Lee, Mohammad Khairul Bashar, Nikhil Shukla, Song-Chun Zhu, Vijaykrishnan Narayanan

摘要:

基于CNF的SAT和MaxSAT求解器是逻辑综合和验证系统的核心。这些约束问题在电子设计自动化中的日益普及,鼓励了对不同SAT问题及其性质的研究,以进一步提高计算效率。现代的基于语法驱动的子句学习SAT求解器在理论和实践上都取得了成功,它允许在相对较短的时间内解决非常大的工业实例。最近,机器学习方法为解决这一具有挑战性的问题提供了新的维度。神经符号模型可以作为通用求解器,可以基于数据专门用于特定领域,而无需对模型的结构进行任何更改。在这项工作中,我们提出了一个单次模型来自Transformer架构来解决最大SAT问题,这是SAT的优化版本,其目标是满足最大数量的条款。我们的模型具有无标度结构,可以处理不同大小的实例。我们使用元路径和自我注意力机制来捕捉同构节点之间的交互。我们在二分图上采用交叉注意力机制来捕捉异构节点之间的交互。我们进一步应用迭代算法,我们的模型,以满足额外的条款,使解决方案接近的一个确切的SAT问题。注意力机制利用并行性来加速。我们的评估表明,改进的加速比相比,启发式方法和改进的完成率相比,机器学习方法。

英文摘要:

CNF-based SAT and MaxSAT solvers are central to logic synthesis and verification systems. The increasing popularity of these constraint problems in electronic design automation encourages studies on different SAT problems and their properties for further computational efficiency. There has been both theoretical and practical success of modern Conflict-driven clause learning SAT solvers, which allows solving very large industrial instances in a relatively short amount of time. Recently, machine learning approaches provide a new dimension to solving this challenging problem. Neural symbolic models could serve as generic solvers that can be specialized for specific domains based on data without any changes to the structure of the model. In this work, we propose a one-shot model derived from the Transformer architecture to solve the MaxSAT problem, which is the optimization version of SAT where the goal is to satisfy the maximum number of clauses. Our model has a scale-free structure which could process varying size of instances. We use meta-path and self-attention mechanism to capture interactions among homogeneous nodes. We adopt cross-attention mechanisms on the bipartite graph to capture interactions among heterogeneous nodes. We further apply an iterative algorithm to our model to satisfy additional clauses, enabling a solution approaching that of an exact-SAT problem. The attention mechanisms leverage the parallelism for speedup. Our evaluation indicates improved speedup compared to heuristic approaches and improved completion rate compared to machine learning approaches.

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

↑