New local search methods for partial MaxSAT

doi:10.1016/j.artint.2016.07.006

CORC > 北京大学 > 信息科学技术学院

	New local search methods for partial MaxSAT
	Cai, Shaowei ; Luo, Chuan ; Lin, Jinkun ; Su, Kaile
刊名	ARTIFICIAL INTELLIGENCE
	2016
关键词	Partial MaxSAT Local search Hard and soft score Initialization CORE-GUIDED MAXSAT CARDINALITY CONSTRAINTS CONFIGURATION CHECKING INFERENCE RULES SAT ALGORITHMS
DOI	10.1016/j.artint.2016.07.006
英文摘要	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.; China National 973 Program [2014CB340301]; National Natural Science Foundation of China [61502464, 61370072, 61572234]; Open Project Program of the State Key Laboratory of Mathematical Engineering and Advanced Computing [2016A06]; ARC [DP150101618]; SCI(E); EI; ARTICLE; shaoweicai.cs@gmail.com; 1-18; 240
语种	英语
内容类型	期刊论文
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/450003]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Cai, Shaowei,Luo, Chuan,Lin, Jinkun,et al. New local search methods for partial MaxSAT[J]. ARTIFICIAL INTELLIGENCE,2016.
APA	Cai, Shaowei,Luo, Chuan,Lin, Jinkun,&Su, Kaile.(2016).New local search methods for partial MaxSAT.ARTIFICIAL INTELLIGENCE.
MLA	Cai, Shaowei,et al."New local search methods for partial MaxSAT".ARTIFICIAL INTELLIGENCE (2016).