MFSAT: a SAT solver using multi-flip local search

A. Mali, Yevgeny Lipen
{"title":"MFSAT: a SAT solver using multi-flip local search","authors":"A. Mali, Yevgeny Lipen","doi":"10.1109/TAI.2003.1250174","DOIUrl":null,"url":null,"abstract":"Local search-based methods of SAT solving have received a significant attention in the last decade. All local search-based methods choose the next truth assignment by flipping the value of only one variable. Simultaneously flipping values of multiple variables on an iteration can allow a local search-based solver to take long leaps in the search space. We report on SAT solver MFSAT, which has nine local search-based procedures. One of them is similar to conventional procedures which flip the value of one variable on an iteration. Other eight procedures are capable of simultaneously flipping values of multiple variables on an iteration to generate the successor truth assignment. We call these procedures \"multi-flip\" procedures. We report on the empirical evaluation of the nine procedures on more than 2700 benchmark SAT problems. Our results show that multi-flip procedures solve many more problems than the uni-flip procedure. Several multi-flip procedures solve problems many times faster than the uni-flip procedure.","PeriodicalId":160023,"journal":{"name":"Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence","volume":"29 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAI.2003.1250174","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Local search-based methods of SAT solving have received a significant attention in the last decade. All local search-based methods choose the next truth assignment by flipping the value of only one variable. Simultaneously flipping values of multiple variables on an iteration can allow a local search-based solver to take long leaps in the search space. We report on SAT solver MFSAT, which has nine local search-based procedures. One of them is similar to conventional procedures which flip the value of one variable on an iteration. Other eight procedures are capable of simultaneously flipping values of multiple variables on an iteration to generate the successor truth assignment. We call these procedures "multi-flip" procedures. We report on the empirical evaluation of the nine procedures on more than 2700 benchmark SAT problems. Our results show that multi-flip procedures solve many more problems than the uni-flip procedure. Several multi-flip procedures solve problems many times faster than the uni-flip procedure.
MFSAT:一个使用多翻转局部搜索的SAT求解器
基于局部搜索的SAT求解方法在过去十年中受到了极大的关注。所有基于局部搜索的方法都只通过翻转一个变量的值来选择下一个真值赋值。在迭代中同时翻转多个变量的值可以使基于局部搜索的求解器在搜索空间中实现长足的飞跃。我们报告了SAT求解器MFSAT,它有九个基于本地搜索的程序。其中一个类似于传统的过程,在迭代中翻转一个变量的值。其他8个过程能够在一次迭代中同时翻转多个变量的值,以生成后继真值赋值。我们称这些程序为“多重翻转”程序。我们报告了对2700多个基准SAT问题的九个程序的实证评估。我们的研究结果表明,多重翻转程序比单次翻转程序解决了更多的问题。几个多重翻转过程解决问题的速度比单次翻转过程快许多倍。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信
小红书