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

借助本地搜索,解决了复杂的SAT实例

Evolving difficult SAT instances thanks to local search

Olivier Bailleux

摘要:

我们建议使用本地搜索算法产生SAT的情况下,更难解决比随机生成的k-CNF公式。初步的搜索算法,获得的结果表明,这种方法值得进一步研究。它可以用作SAT求解器的鲁棒性测试,并可以帮助研究分支算法,学习策略和求解器的其他方面如何影响鲁棒性。

英文摘要:

We propose to use local search algorithms to produce SAT instances which are harder to solve than randomly generated k-CNF formulae. The first results, obtained with rudimentary search algorithms, show that the approach deserves further study. It could be used as a test of robustness for SAT solvers, and could help to investigate how branching heuristics, learning strategies, and other aspects of solvers impact there robustness.

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

↑