通过防止三角形生成困难的SAT图
Generating Difficult SAT Instances by Preventing Triangles
摘要:
在为SAT求解器创建基准测试时,我们需要容易构建但难以求解的SAT实例。在寻找这种方法的最新发展导致了平衡SAT算法,它可以创建具有m个高难度子句的k-SAT实例,对于任意k和m。本文介绍了一种基于聚类系数图统计的可满足性实例生成器--非三角形可满足性算法。我们经验比较两个算法固定的arity和变量的数量,但不同的条款的数量。我们发现的最困难的例子是由非三角形SAT产生的。此外,来自非三角形SAT的困难实例具有与来自平衡SAT的困难实例不同的子句数量,潜在地允许两种方法的组合来为更大的参数阵列找到硬SAT实例。
英文摘要:
When creating benchmarks for SAT solvers, we need SAT instances that are easy to build but hard to solve. A recent development in the search for such methods has led to the Balanced SAT algorithm, which can create k-SAT instances with m clauses of high difficulty, for arbitrary k and m. In this paper we introduce the No-Triangle SAT algorithm, a SAT instance generator based on the cluster coefficient graph statistic. We empirically compare the two algorithms by fixing the arity and the number of variables, but varying the number of clauses. The hardest instances that we find are produced by No-Triangle SAT. Furthermore, difficult instances from No-Triangle SAT have a different number of clauses than difficult instances from Balanced SAT, potentially allowing a combination of the two methods to find hard SAT instances for a larger array of parameters.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。