arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2112.09438cs.AIcs.CRcs.LG
收藏

ML支持的SAT求解器性能预测

ML Supported Predictions for SAT Solvers Performance

Federal Office for Information Security(德国联邦信息安全办公室)

A. -M. Leventi-Peetz, Jörg-Volker Peetz, Martina Rohde

摘要:

为了对开源SAT求解器CryptoMiniSat在多线程模式下处理难以解决布尔可满足性问题实例时的不确定性终止行为进行分类,收集并分析了内部求解器运行时参数。这些参数的子集已被选择并用作特征向量,以成功地创建机器学习模型,用于对求解器的终止行为进行二进制分类,并对尚未求解的实例进行任何新的求解运行。该模型可用于早期估计的解决尝试属于或不属于类的候选人具有良好的机会快速终止。在这种情况下,运行时特性的活动配置文件的组合似乎反映了求解器的瞬时性能对求解器的解决过程的即时质量的影响。由于前两次求解迭代的运行时参数足以预测成功分数良好的尝试的终止,因此本工作的结果提供了一个有希望的基础,可以进一步开发,以丰富CryptoMiniSat或任何具有AI能力的现代SAT求解器。

英文摘要:

In order to classify the indeterministic termination behavior of the open source SAT solver CryptoMiniSat in multi-threading mode while processing hard to solve boolean satisfiability problem instances, internal solver runtime parameters have been collected and analyzed. A subset of these parameters has been selected and employed as features vector to successfully create a machine learning model for the binary classification of the solver's termination behavior with any single new solving run of a not yet solved instance. The model can be used for the early estimation of a solving attempt as belonging or not belonging to the class of candidates with good chances for a fast termination. In this context a combination of active profiles of runtime characteristics appear to mirror the influence of the solver's momentary heuristics on the immediate quality of the solver's resolution process. Because runtime parameters of already the first two solving iterations are enough to forecast termination of the attempt with good success scores, the results of the present work deliver a promising basis which can be further developed in order to enrich CryptoMiniSat or generally any modern SAT solver with AI abilities.

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

↑