期刊文献+

基于扩展失败文字检测的MaxSAT完备算法 被引量:2

MaxSAT complete algorithm based on extended failed literal detection
下载PDF
导出
摘要 为提高MaxSAT完备算法剪枝率和运算效率,分析失败文字检测寻找冲突集的过程,提出扩展失败文字检测方法。通过延长失败文字搜索冲突的路径,形成搜索1步、2步和任意步的递进失败文字检测方式,实现改进的MaxsatzEF算法。实验测试了MaxSAT国际竞赛4个类别的500多个算例,实验结果表明,递进失败文字检测方法找到了更多独立冲突集,可有效提高算法的下界,大幅缩短复杂算例的运行时间。 To improve prune rate and running time of maximum satisfiability problem(MaxSAT problem)algorithms,the searching process of failed literal detection for conflicted sets was analyzed.Extended failed literal detection was proposed to increase the rooting of search conflict in inference graph,climactic way was executed by searching one step,two steps and any steps.The improved MaxsatzEF algorithm was then realized.More than five hundred MaxSAT instances from MaxSAT evaluation competition benchmark in four different MaxSAT problem types were tested.Experimental results show that progressive failed literal detection find more independent conflict sets,which increases the lower bounds effectively and cuts off running time to a great extent for complicated instance at last.
出处 《计算机工程与设计》 北大核心 2015年第3期669-673,共5页 Computer Engineering and Design
基金 国家自然科学基金项目(51306133)
关键词 NP难问题 可满足性问题 最大可满足性问题 分支限界 失败文字检测 NP complete problem satisfiability problem maximum satisfiability problem branch and bounds failed literal detection
  • 相关文献

参考文献9

  • 1Federico Heras, Javier Larrosa, Albert Oliveras. MINIMAX- SAT: An efficient weighted MaxSAT solver [J]. Journal of Artificial Intelligence Research, 2008, 31: 1-32.
  • 2Josep Argelieh, Li Chumin, Felip Manya, et al. Analyzing the instances of the MaxSAT evaluation [G]. LNCS 6695: Proceedings of the 14th Theory and Application of Satisfiablity Testing, 2011: 360-361.
  • 3刘燕丽,李初民,何琨.基于优化冲突集提高下界的MAXSAT完备算法[J].计算机学报,2013,36(10):2087-2095. 被引量:5
  • 4Li Chumin, Manya Felip, Nouredine Mohamedou, et al. Re- solution based lower bounds in MaxSAT [J]. Journal of Con- straints, 2010, 15 (4): 456-484.
  • 5Li Chumin, Manya Felip, Planes Jordi. New inference rules for Max-SAT [J]. Journal of Artificial Intelligenee Research, 2007, 30: 321-329.
  • 6MaxSAT Evaluation Website [CP/OL]. http: //www. max- sat. udl. cat, 2013.
  • 7Carlos Ansotegui, Maria Luisa Eonet, Jordi Levy. A new algo- rithms for weighted partial MaxSAT [C] //Proceedings of the 24th AAAI Conference on Artificial Intelligence, 2010: 3-8.
  • 8Carlos Ansotegui, Maria Luisa Bonet, Jordi Levy. SAT-based MaxSAT algorithms [J]. Journal of Artificial Intelligence, 2013, 196~ 77-105.
  • 9Li Chumin, Manya Felip, Nouredine Mohamedou, et al. Ex- ploiting cycle structures in MaxSAT [C] //Proceedings of the 12th Theory and Applications of Satisfiability Testing, 2009: 467-480.

二级参考文献2

共引文献4

同被引文献19

  • 1李伟,曾文华.求解MAX-CNF问题的一种随机近似算法[J].计算机工程与应用,2006,42(34):39-41. 被引量:1
  • 2Stephen A C. The complexity of theorem proving procedures. In:The 3rd Annual ACM Symposium on Theory of Computing. Shaker Heights, Ohio, United States : Association for Computing Machinery, 1971 : 151 - 158.
  • 3Li C, Felip M, Jordi P. New inference rules for Max-SAT. Journal of Artificial Intelligence Research, 2007,30 : 321 - 329.
  • 4Fu Z, Malik S. On solving the partial MaxSAT problem. In: The 9th Theory and Applications of Satisfiability Testing Seattle. USA: Springer Verlag,2006:252-265.
  • 5Ruben M, Vasco M, In6s L. Open-WBO: A modular MaxSAT solver. In:The 17'h Theory and Applications of Satisfiability Testing. Vienna, Austria:Springer Verlag,2014,8561:438 445.
  • 6Ruben M, Saurabh J. Incremental eardinality constraints for MaxSAT. In: The 20th International Conference on Principles and Practice of Constraint Programming. Lyon. France: Springer in the Leeture Notes in Computer Sciences Series,2014:531 48.
  • 7Argelich J, Li C, Manya F, et al. MaxSAT evaluation 2014. In: The 17th Theory and Applications of Satisfiability Testing. Vienna, Austria : Springer Verlag, 2014 : 360 - 380.
  • 8Federico H, Antonio M, Sliva J M. MaxSAT- based encodings for group MaxSAT. AI Commu- nications, 2015,28(2) : 195 - 214.
  • 9Ignatiev A, Morgado A, Manquinho V, et al. Progression in maximum satisfiability. Frontiers in Artificial Intelligenee and Applieations, 2014, 263:453 448.
  • 10Ansotegui C, Malitsky Y, Sellman M. MaxSAT by improved instance-specific algorithm configuration. In= The 28'" AAAI conference on Artificial Intelligence. Quebec city, Canada: Elserviger, 2014 : 2594- 2600.

引证文献2

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部