| New local search methods for partial MaxSAT |
| Cai, SW; Luo, CA; Lin, JK; Su, KL
|
| 2016
|
| 发表期刊 | ARTIFICIAL INTELLIGENCE
 |
| ISSN | 0004-3702
|
| 卷号 | 240页码:1-18 |
| 摘要 | Maximum Satisfiability (MaxSAT) is the optimization version of the Satisfiability (SAT) problem. Partial Maximum Satisfiability (PMS) is a generalization of MaxSAT which involves hard and soft clauses and has important real world applications. Local search is a popular approach to solving SAT and MaxSAT and has witnessed great success in these two problems. However, unfortunately, local search algorithms for PMS do not benefit much from local search techniques for SAT and MaxSAT, mainly due to the fact that it contains both hard and soft clauses. This feature makes it more challenging to design efficient local search algorithms for PMS, which is likely the reason of the stagnation of this direction in more than one decade. In this paper, we propose a number of new ideas for local search for PMS, which mainly rely on the distinction between hard and soft clauses. The first three ideas, including weighting for hard clauses, separating hard and soft score, and a variable selection heuristic based on hard and soft score, are used to develop a local search algorithm for PMS called Dist. The fourth idea, which uses unit propagation with priority on hard unit clauses to generate the initial assignment, is used to improve Dist on industrial instances, leading to the DistUP algorithm. The effectiveness of our solvers and ideas is illustrated through experimental evaluations on all PMS benchmarks from the MaxSAT Evaluation 2014. According to our experimental results, Dist shows a significant improvement over previous local search solvers on all benchmarks. We also compare our solvers with state-of-the-art complete PMS solvers and a state-of-the-art portfolio solver, and the results show that our solvers have better performance in random and crafted instances but worse in industrial instances. The good performance of Dist has also been confirmed by the fact that Dist won all random and crafted categories of PMS and Weighted PMS in the incomplete solvers track of the MaxSAT Evaluation 2014. (C) 2016 Elsevier B.V. All rights reserved.; Maximum Satisfiability (MaxSAT) is the optimization version of the Satisfiability (SAT) problem. Partial Maximum Satisfiability (PMS) is a generalization of MaxSAT which involves hard and soft clauses and has important real world applications. Local search is a popular approach to solving SAT and MaxSAT and has witnessed great success in these two problems. However, unfortunately, local search algorithms for PMS do not benefit much from local search techniques for SAT and MaxSAT, mainly due to the fact that it contains both hard and soft clauses. This feature makes it more challenging to design efficient local search algorithms for PMS, which is likely the reason of the stagnation of this direction in more than one decade. In this paper, we propose a number of new ideas for local search for PMS, which mainly rely on the distinction between hard and soft clauses. The first three ideas, including weighting for hard clauses, separating hard and soft score, and a variable selection heuristic based on hard and soft score, are used to develop a local search algorithm for PMS called Dist. The fourth idea, which uses unit propagation with priority on hard unit clauses to generate the initial assignment, is used to improve Dist on industrial instances, leading to the DistUP algorithm. The effectiveness of our solvers and ideas is illustrated through experimental evaluations on all PMS benchmarks from the MaxSAT Evaluation 2014. According to our experimental results, Dist shows a significant improvement over previous local search solvers on all benchmarks. We also compare our solvers with state-of-the-art complete PMS solvers and a state-of-the-art portfolio solver, and the results show that our solvers have better performance in random and crafted instances but worse in industrial instances. The good performance of Dist has also been confirmed by the fact that Dist won all random and crafted categories of PMS and Weighted PMS in the incomplete solvers track of the MaxSAT Evaluation 2014. (C) 2016 Elsevier B.V. All rights reserved. |
| 收录类别 | SCI
|
| 关键词 | Partial Maxsat
Local Search
Hard And Soft Score
Initialization
|
| 部门归属 | Chinese Acad Sci, Inst Software, State Key Lab Comp Sci, Beijing 100190, Peoples R China. Chinese Acad Sci, Inst Comp Technol, Beijing 100190, Peoples R China. Peking Univ, Sch Elect Engn & Comp Sci, Beijing 100871, Peoples R China. Griffith Univ, Inst Integrated & Intelligent Syst, Brisbane, Qld 4111, Australia.
|
| 语种 | 英语
|
| WOS记录号 | WOS:000384851300001
|
| 引用统计 |
|
| 内容类型 | 期刊论文
|
| URI标识 | http://ir.iscas.ac.cn/handle/311060/17292
|
| 专题 | 中国科学院软件研究所
|
推荐引用方式
GB/T 7714 |
Cai, SW,Luo, CA,Lin, JK,et al. New local search methods for partial MaxSAT[J]. ARTIFICIAL INTELLIGENCE,2016,240:1-18.
|
| APA |
Cai, SW,Luo, CA,Lin, JK,&Su, KL.(2016).New local search methods for partial MaxSAT.ARTIFICIAL INTELLIGENCE,240,1-18.
|
| MLA |
Cai, SW,et al."New local search methods for partial MaxSAT".ARTIFICIAL INTELLIGENCE 240(2016):1-18.
|
修改评论