图搜索的智能分块:一项比较研究
Smart Cubing for Graph Search: A Comparative Study
AI总结:
针对带传播器的SAT求解在cube-and-conquer并行化中面临的动态学习挑战,以SMS为测试用例,结合预运行、分块策略与LLM辅助调优,在三个组合问题上实现2-3倍加速。
摘要:
通过 cube-and-conquer 进行并行求解是将 SAT 求解器扩展至困难实例的关键方法。尽管 cube-and-conquer 在纯 SAT 问题(尤其是 Pythagorean triples conjecture)上已证明是成功的,但将其应用于扩展了传播器的 SAT 求解器时却面临独特的挑战,因为这些传播器在搜索过程中会动态学习约束。我们以 SAT Modulo Symmetries (SMS) 作为主要测试用例来研究此问题,其中对称性破坏传播器通过学习消除同构图来缩减搜索空间。通过包含超过 10,000 个 CPU 小时的大量实验,我们系统地评估了不同的 cube-and-conquer 变体在三个被充分研究的组合问题上的表现。我们的方法结合了用于收集学习约束的预运行阶段、各种分块策略,以及通过算法配置和 LLM 生成的设计建议进行的参数调优。这项全面的实证评估为基于传播器的 SAT 求解提供了关于有效分块策略的新见解,我们最佳的方法通过改进分块和参数调优实现了 2-3 倍的加速,并在更困难的实例上获得了额外的 1.5-2 倍提升。
英文摘要:
Parallel solving via cube-and-conquer is a key method for scaling SAT solvers to hard instances. While cube-and-conquer has proven successful for pure SAT problems, notably the Pythagorean triples conjecture, its application to SAT solvers extended with propagators presents unique challenges, as these propagators learn constraints dynamically during the search. We study this problem using SAT Modulo Symmetries (SMS) as our primary test case, where a symmetry-breaking propagator reduces the search space by learning constraints that eliminate isomorphic graphs. Through extensive experimentation comprising over 10,000 CPU hours, we systematically evaluate different cube-and-conquer variants on three well-studied combinatorial problems. Our methodology combines prerun phases to collect learned constraints, various cubing strategies, and parameter tuning via algorithm configuration and LLM-generated design suggestions. The comprehensive empirical evaluation provides new insights into effective cubing strategies for propagator-based SAT solving, with our best method achieving speedups of 2-3x from improved cubing and parameter tuning, providing an additional 1.5-2x improvement on harder instances.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。