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

再论习得小句数据库缩减策略

Revisiting the Learned Clauses Database Reduction Strategies

CRIL - CNRS(CRIL - 法国国家科学研究中心);Université d’Artois(阿图瓦大学)

Said Jabbour, Jerry Lonlac, Lakhdar Sais, Yakoub Salhi

摘要:

在本文中,我们重新审视一个重要的问题,基于CDCL的SAT求解器,即学习子句数据库管理策略。我们的动机是从一个简单的观察随机和大小有界的减少策略的显着表现的来源。我们首先推导出一个简单的约简策略,称为大小有界随机策略(简称SBR),它结合了maintaing短子句(大小由k限制),同时删除大小大于k的随机子句。由此产生的战略优于国家的最先进的,即基于LBD的一个,从最后的SAT竞争的SAT实例。加强保持短条款的兴趣,我们提出了几个新的动态变量,我们讨论了它们的性能。

英文摘要:

In this paper, we revisit an important issue of CDCL-based SAT solvers, namely the learned clauses database management policies. Our motivation takes its source from a simple observation on the remarkable performances of both random and size-bounded reduction strategies. We first derive a simple reduction strategy, called Size-Bounded Randomized strategy (in short SBR), that combines maintaing short clauses (of size bounded by k), while deleting randomly clauses of size greater than k. The resulting strategy outperform the state-of-the-art, namely the LBD based one, on SAT instances taken from the last SAT competition. Reinforced by the interest of keeping short clauses, we propose several new dynamic variants, and we discuss their performances.

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

↑