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

针对 Max-SAT 的资源受限启发式方法

Resource-Constrained Heuristic for Max-SAT

SRI International(SRI国际)

Brian Matejek, Daniel Elenius, Cale Gentry, David Stoker, Adam Cobb

AI总结:

提出一种资源受限的 Max-SAT 启发式方法,通过内外循环分解问题,支持传统求解器或 QUBO 专用硬件优化,并优于现有方案。

摘要:

我们提出了一种针对 Max-SAT 实例的资源受限启发式方法,该方法迭代地将较大的问题分解为可由优化求解器和硬件求解的较小子组件。无约束的外层循环维护给定问题的状态空间,并独立于先前调用选择 SAT 变量的子集进行优化。资源受限的内层循环最大化“sub-SAT”问题中可满足子句的数量。我们的外层循环与内层循环的机制无关,允许在优化步骤中使用传统求解器。然而,我们也可以将选定的“sub-SAT”问题转化为二次无约束二元优化(QUBO)问题,并使用专用硬件进行优化。与在分解前将 SAT 实例转换为 QUBO 的现有解决方案不同,我们在 QUBO 优化之前选择 SAT 变量的子集。我们分析了一组变量选择方法,包括一种利用给定 SAT 实例结构的新颖的基于图的方法。编码一个(子)SAT 问题所需的 QUBO 变量数量各不相同,因此我们还额外学习了一个模型,用于预测能够适配固定大小 QUBO 求解器的 sub-SAT 问题的大小。我们在一组随机生成的 Max-SAT 实例以及来自 Max-SAT 评测基准的真实世界示例上实证展示了我们的结果,并优于现有的 QUBO 分解器解决方案。

英文摘要:

We propose a resource-constrained heuristic for instances of Max-SAT that iteratively decomposes a larger problem into smaller subcomponents that can be solved by optimized solvers and hardware. The unconstrained outer loop maintains the state space of a given problem and selects a subset of the SAT variables for optimization independent of previous calls. The resource-constrained inner loop maximizes the number of satisfiable clauses in the "sub-SAT" problem. Our outer loop is agnostic to the mechanisms of the inner loop, allowing for the use of traditional solvers for the optimization step. However, we can also transform the selected "sub-SAT" problem into a quadratic unconstrained binary optimization (QUBO) one and use specialized hardware for optimization. In contrast to existing solutions that convert a SAT instance into a QUBO one before decomposition, we choose a subset of the SAT variables before QUBO optimization. We analyze a set of variable selection methods, including a novel graph-based method that exploits the structure of a given SAT instance. The number of QUBO variables needed to encode a (sub-)SAT problem varies, so we additionally learn a model that predicts the size of sub-SAT problems that will fit a fixed-size QUBO solver. We empirically demonstrate our results on a set of randomly generated Max-SAT instances as well as real world examples from the Max-SAT evaluation benchmarks and outperform existing QUBO decomposer solutions.

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

↑