More efficient two-mode stochastic local search for random 3-satisfiability
文献类型：期刊论文
| 作者 | Luo, Chuan (1) ; Su, Kaile (2) ; Cai, Shaowei (3) |
| 刊名 | Applied Intelligence
 |
| 出版日期 | 2014 |
| 卷号 | 41期号:3页码:665-680 |
| 关键词 | Local search Satisfiability Linear combination Greedy Diversification Property |
| ISSN号 | 0924669X |
| 通讯作者 | Luo, C.(chuanluosaber@gmail.com) |
| 中文摘要 | Stochastic local search (SLS) is a popular paradigm in incomplete solving for the Boolean satisfiability problem (SAT). Most SLS solvers for SAT switch between two modes, i.e., the greedy (intensification) mode and the diversification mode. However, the performance of these two-mode SLS algorithms lags far behind on solving random 3-satisfiability (3-SAT) problem, which is a significant special case of the SAT problem. In this paper, we propose a new hybrid scoring function called MC based on a linear combination of a greedy property make and a diversification property ConfTimes, and then utilize MC to develop a new two-mode SLS solver called CCMC. To evaluate the performance of CCMC, we conduct extensive experiments to compare CCMC with five state-of-the-art two-mode SLS solvers (i.e., Sparrow2011, Sattime2011, EagleUP, gNovelty+PCL and CCASat) on a broad range of random 3-SAT instances, including all large 3-SAT ones from SAT Competition 2009 and SAT Competition 2011 as well as 200 generated satisfiable huge random 3-SAT ones. The experiments illustrate that CCMC obviously outperforms its competitors, indicating the effectiveness of CCMC. We also analyze the effectiveness of the underlying ideas in CCMC and further improve the performance of CCMC on solving random 5-SAT instances. © 2014 Springer Science+Business Media New York. |
| 英文摘要 | Stochastic local search (SLS) is a popular paradigm in incomplete solving for the Boolean satisfiability problem (SAT). Most SLS solvers for SAT switch between two modes, i.e., the greedy (intensification) mode and the diversification mode. However, the performance of these two-mode SLS algorithms lags far behind on solving random 3-satisfiability (3-SAT) problem, which is a significant special case of the SAT problem. In this paper, we propose a new hybrid scoring function called MC based on a linear combination of a greedy property make and a diversification property ConfTimes, and then utilize MC to develop a new two-mode SLS solver called CCMC. To evaluate the performance of CCMC, we conduct extensive experiments to compare CCMC with five state-of-the-art two-mode SLS solvers (i.e., Sparrow2011, Sattime2011, EagleUP, gNovelty+PCL and CCASat) on a broad range of random 3-SAT instances, including all large 3-SAT ones from SAT Competition 2009 and SAT Competition 2011 as well as 200 generated satisfiable huge random 3-SAT ones. The experiments illustrate that CCMC obviously outperforms its competitors, indicating the effectiveness of CCMC. We also analyze the effectiveness of the underlying ideas in CCMC and further improve the performance of CCMC on solving random 5-SAT instances. © 2014 Springer Science+Business Media New York. |
| 收录类别 | SCI ; EI |
| 语种 | 英语 |
| WOS记录号 | WOS:000342426700001 |
| 公开日期 | 2014-12-16 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/16809]  |
| 专题 | 软件研究所_软件所图书馆_期刊论文 |
| 推荐引用方式 GB/T 7714 | Luo, Chuan ,Su, Kaile ,Cai, Shaowei . More efficient two-mode stochastic local search for random 3-satisfiability[J]. Applied Intelligence,2014,41(3):665-680. |
| APA | Luo, Chuan ,Su, Kaile ,&Cai, Shaowei .(2014).More efficient two-mode stochastic local search for random 3-satisfiability.Applied Intelligence,41(3),665-680. |
| MLA | Luo, Chuan ,et al."More efficient two-mode stochastic local search for random 3-satisfiability".Applied Intelligence 41.3(2014):665-680. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。