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

基于电路级阿米巴的SAT求解器

A Circuit-Level Amoeba-Inspired SAT Solver

N. Takeuchi, M. Aono, Y. Hara-Azumi, C. L. Ayala

摘要:

AmbSAT(或AmoebaSAT)是一个生物启发的随机局部搜索(SLS)求解器,用于探索布尔可满足性问题(SAT)的解决方案。AmbSAT在每个迭代步骤中并行更新多个变量,因此AmbSAT可以为特定的SAT实例集找到比其他一些常规SLS求解器更少的迭代步骤数的解。然而,AmbSAT的并行性与通用微处理器不兼容,因为执行每次迭代需要许多时钟周期;因此,AmbSAT需要特殊的硬件,可以利用AmbSAT的并行性来快速找到解决方案。在本文中,我们提出了一个电路模型(硬件友好的算法),探索解决方案,以类似于AmbSAT,我们称之为电路级AmbSAT(CL-AmbSAT)。我们进行了数值模拟,以评估搜索性能的CL-AmbSAT随机生成的SAT实例,旨在估计我们的方法的可扩展性。仿真结果表明,CL-AmbSAT找到的解决方案与更少的迭代次数比一个强大的SLS求解器,ProbSAT,甚至优于AmbSAT。由于CL-AmbSAT使用简单的组合逻辑来更新变量,因此CL-AmbSAT可以很容易地在各种硬件中实现。

英文摘要:

AmbSAT (or AmoebaSAT) is a biologically-inspired stochastic local search (SLS) solver to explore solutions to the Boolean satisfiability problem (SAT). AmbSAT updates multiple variables in parallel at every iteration step, and thus AmbSAT can find solutions with a fewer number of iteration steps than some other conventional SLS solvers for a specific set of SAT instances. However, the parallelism of AmbSAT is not compatible with general-purpose microprocessors in that many clock cycles are required to execute each iteration; thus, AmbSAT requires special hardware that can exploit the parallelism of AmbSAT to quickly find solutions. In this paper, we propose a circuit model (hardware-friendly algorithm) that explores solutions to SAT in a similar way to AmbSAT, which we call circuit-level AmbSAT (CL-AmbSAT). We conducted numerical simulation to evaluate the search performance of CL-AmbSAT for a set of randomly generated SAT instances that was designed to estimate the scalability of our approach. Simulation results showed that CL-AmbSAT finds solutions with a fewer iteration number than a powerful SLS solver, ProbSAT, and outperforms even AmbSAT. Since CL-AmbSAT uses simple combinational logic to update variables, CL-AmbSAT can be easily implemented in various hardware.

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

↑