首页> 外文会议>International Conference on Theory and Applications of Satisfiability Testing - SAT >SharpSAT — Counting Models with Advanced Component Caching and Implicit BCP
【24h】

SharpSAT — Counting Models with Advanced Component Caching and Implicit BCP

机译:Sharpsat - 使用高级组件缓存和隐式BCP的计数模型

获取原文

摘要

We introduce sharpSAT, a new #SAT solver that is based on the well known DPLL algorithm and techniques from SAT and #SAT solvers. Most importantly, we introduce an entirely new approach of coding components, which reduces the cache size by at least one order of magnitude, and a new cache management scheme. Furthermore, we apply a well known look ahead based on BCP in a manner that is well suited for #SAT solving. We show that these techniques are highly beneficial, especially on large structured instances, such that our solver performs significantly better than other #SAT solvers.
机译:我们介绍Sharpsat,这是一种新的#sat求解器,它基于众所周知的DPLL算法和SAT和#SAT求解器的技术。最重要的是,我们介绍了一种编码组件的完全新方法,其减少了至少一个幅度的高速缓存大小,以及新的缓存管理方案。此外,我们以非常适合于#SAT解决的方式应用基于BCP的众所周知的展示。我们表明,这些技术非常有益,特别是在大型结构化实例上,使我们的求解器显着优于其他#SAT求解器。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号