.png){kind=icon}
返回
A randomized diversification strategy for solving satisfiability problem with long clauses
.png){kind=icon}
PRE
AI
DOI：10.1007/s11432-016-0258-4.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Satisfiability problem (SAT) is a central problem in artificial intelligence due to its computational complexity and usefulness in industrial applications. Stochastic local search (SLS) algorithms are powerful to solve hard instances of satisfiability problems, among which CScoreSAT is proposed for solving SAT instances with long clauses by using greedy mode and diversification mode. In this paper, we present a randomized variable selection strategy to improve efficiency of the diversification mode, and thus propose a new SLS algorithm. We perform a number of experiments to evaluate the new algorithm comparing with the recently proposed algorithms, and show that our algorithm is comparative with others for solving random instances near the phase transition threshold.
Keyword:
SAT
local search
randomized diversification strategy
phase transition
long clause
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
4.9K
被引数:
8.9K
机构
引用论文
.png){kind=icon}
分享收藏
A novel local search for unicost set covering problem using hyperedge configuration checking and weight diversity使用hyperedge配置检查和权重多样性对unicost集覆盖问题进行新颖的局部搜索
PREAI
分享收藏分享收藏分享收藏
分享收藏
查看更多内容