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.
Learning Variable Ordering Heuristics for Solving Constraint Satisfaction Problems
Shandong University(山东大学);Singapore Institute of Manufacturing Technology(新加坡制造技术研究院);Nanyang Technological University(南洋理工大学);Southwest Jiaotong University(西南交通大学)
Heuristic Multiobjective Discrete Optimization using Restricted Decision Diagrams
Department of Mechanical and Industrial Engineering, University of Toronto(多伦多大学机械与工业工程系);Department of Operations and Information Management, University of Connecticut(康涅狄格大学运营与信息管理系)
Learning Branching Heuristics for Propositional Model Counting
University of Toronto(多伦多大学);UC Berkeley(加州大学伯克利分校);Vector Institute(向量研究所)
命题模型计数(Propositional Model Counting),或#SAT,是计算布尔公式的满意赋值的数量的问题。来自不同应用领域的许多问题,包括许多离散概率推理问题,可以转化为模型计数问题,由#SAT求解器来解决。然而,精确的#SAT求解器通常不能扩展到工业规模的实例。在本文中,我们提出了Neuro#,一种用于学习分支算法的方法,以提高给定问题族实例上的精确SAT求解器的性能。我们的实验表明,我们的方法减少了类似的分布式举行了实例的步骤数,并推广到更大的实例,从同一个问题的家庭。它是能够实现这些结果对一些不同的问题家庭具有非常不同的结构。除了步数改进之外,Neuro#还可以在某些问题族中的较大实例上实现比vanilla求解器高出几个数量级的挂钟加速,尽管查询模型的运行时开销很大。
CAHS-Attack: CLIP-Aware Heuristic Search Attack Method for Stable Diffusion
Beijing University of Posts and Telecommunications(北京邮电大学);China Mobile Ltd, Department of Cyber and Information Security Management(中国移动有限公司,网络安全与信息安全管理部);Aspire Information Technology (Beijing) Company Limited(aspire信息技术(北京)有限公司)
A Learning Search Algorithm for the Restricted Longest Common Subsequence Problem
Faculty of Natural Sciences and Mathematics, University of Banja Luka(巴尼亚卢卡大学自然科学与数学系);Artificial Intelligence Research Institute(人工智能研究所);Jožef Stefan Institute(约瑟夫·斯特凡研究所);Faculty of Mathematics, University of Belgrade(贝尔格莱德大学数学系)
Approximating the Backbone in the Weighted Maximum Satisfiability Problem
School of Software, Dalian University of Technology(大连理工大学软件学院);The State Key Laboratory of Computer Science, Institute of Software, CAS(中国科学院软件研究所计算机科学国家重点实验室)
加权最大可满足性问题(weighted Maximum Satisfiability problem,简称MAX-SAT)是一个NP难问题,在人工智能中有着广泛的应用。主干作为一种有效的启发式设计工具,已被应用于许多NP难问题的启发式设计中。本文研究了在加权MAX-SAT中检索骨干的计算复杂性,并提出了一种新的算法来解决这个问题。我们证明了在以下假设下检索完整的主干是困难的。此外,它是棘手的,以恢复一个固定的骨干部分,以及。在此基础上,提出了一种基于Walksat算子的骨干引导局部搜索算法(BGLS)。BGLS包括两个阶段:第一阶段从局部最优解中抽取骨干信息,骨干阶段在骨干的指导下进行局部搜索。在基准测试上的大量实验结果表明,BGLS在解的质量和运行时间方面都优于现有的算法。
Discovering heuristics in a complex SAT solver with large language models
School of Data Science, Fudan University, Shanghai, China(复旦大学数据科学学院,上海,中国);Key Laboratory of System Software, Institute of Software, Chinese Academy of Sciences, Beijing, China(中国科学院软件研究所系统软件重点实验室,北京,中国);SeedMath Technology Limited, Beijing, China(SeedMath技术有限公司,北京,中国)