基于活化率的分支策略选择方法

Mao Luo, Chu Min Li, Xinyun Wu, Shuolin Li, Zhipeng Lü
{"title":"基于活化率的分支策略选择方法","authors":"Mao Luo, Chu Min Li, Xinyun Wu, Shuolin Li, Zhipeng Lü","doi":"10.21655/ijsi.1673-7288.00278","DOIUrl":null,"url":null,"abstract":"The two most effective branching strategies LRB and VSIDS perform differently on different types of instances. Generally, LRB is more effective on crafted instances, while VSIDS is more effective on application ones. However, distinguishing the types of instances is difficult. To overcome this drawback, we propose a branching strategy selection approach based on the vivification ratio. This approach uses the LRB branching strategy more to solve the instances with a very low vivification ratio. We tested the instances from the main track of SAT competitions in recent years. The results show that the proposed approach is robust and it significantly increases the number of solved instances. It is worth mentioning that, with the help of our approach, the solver Maple CM can solve more than 16 instances for the benchmark from the 2020 SAT competition.","PeriodicalId":218849,"journal":{"name":"Int. J. Softw. Informatics","volume":"8 9-10","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Branching Strategy Selection Approach Based on Vivification Ratio\",\"authors\":\"Mao Luo, Chu Min Li, Xinyun Wu, Shuolin Li, Zhipeng Lü\",\"doi\":\"10.21655/ijsi.1673-7288.00278\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The two most effective branching strategies LRB and VSIDS perform differently on different types of instances. Generally, LRB is more effective on crafted instances, while VSIDS is more effective on application ones. However, distinguishing the types of instances is difficult. To overcome this drawback, we propose a branching strategy selection approach based on the vivification ratio. This approach uses the LRB branching strategy more to solve the instances with a very low vivification ratio. We tested the instances from the main track of SAT competitions in recent years. The results show that the proposed approach is robust and it significantly increases the number of solved instances. It is worth mentioning that, with the help of our approach, the solver Maple CM can solve more than 16 instances for the benchmark from the 2020 SAT competition.\",\"PeriodicalId\":218849,\"journal\":{\"name\":\"Int. J. Softw. Informatics\",\"volume\":\"8 9-10\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Softw. Informatics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.21655/ijsi.1673-7288.00278\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Softw. Informatics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.21655/ijsi.1673-7288.00278","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

两种最有效的分支策略LRB和VSIDS在不同类型的实例上的表现不同。通常,LRB在精心制作的实例上更有效,而VSIDS在应用程序实例上更有效。然而,区分实例的类型是困难的。为了克服这一缺点,我们提出了一种基于活化率的分支策略选择方法。这种方法更多地使用LRB分支策略来解决激活率非常低的实例。我们从近年来的SAT比赛主赛道上进行了实例测试。结果表明,该方法具有较强的鲁棒性,显著提高了求解实例的数量。值得一提的是,在我们的方法的帮助下,求解器Maple CM可以为2020年SAT竞赛的基准解决超过16个实例。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Branching Strategy Selection Approach Based on Vivification Ratio
The two most effective branching strategies LRB and VSIDS perform differently on different types of instances. Generally, LRB is more effective on crafted instances, while VSIDS is more effective on application ones. However, distinguishing the types of instances is difficult. To overcome this drawback, we propose a branching strategy selection approach based on the vivification ratio. This approach uses the LRB branching strategy more to solve the instances with a very low vivification ratio. We tested the instances from the main track of SAT competitions in recent years. The results show that the proposed approach is robust and it significantly increases the number of solved instances. It is worth mentioning that, with the help of our approach, the solver Maple CM can solve more than 16 instances for the benchmark from the 2020 SAT competition.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信