QQ客服 官方微博 反馈留言

	Tailoring local search for partial MaxSAT
	Cai, Shaowei ; Luo, Chuan ; Thornton, John ; Su, Kaile
	2014
英文摘要	Partial MaxSAT (PMS) is a generalization to SAT and MaxSAT. Many real world problems can be encoded into PMS in a more natural and compact way than SAT and MaxSAT. In this paper, we propose new ideas for local search for PMS, which mainly rely on the distinction between hard and soft clauses. We use these ideas to develop a local search PMS algorithm called Dist. Experimental results on PMS benchmarks from MaxSAT Evaluation 2013 show that Dist significantly outperforms state-of-the-art PMS algorithms, including both local search algorithms and complete ones, on random and crafted benchmarks. For the industrial benchmark, Dist dramatically outperforms previous local search algorithms and is comparable with complete algorithms. Copyright ? 2014, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.; EI; 0
语种	英语
内容类型	其他
源URL	[http://ir.pku.edu.cn/handle/20.500.11897/329412]
专题	信息科学技术学院
推荐引用方式 GB/T 7714	Cai, Shaowei,Luo, Chuan,Thornton, John,et al. Tailoring local search for partial MaxSAT. 2014-01-01.

个性服务

查看访问统计

相关权益政策

暂无数据

收藏/分享

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。