CHAMP: A multipass algorithm for Max Sat based on saver variables

IF 0.9 4区 数学 Q3 MATHEMATICS, APPLIED
Daniel Berend , Shahar Golan , Yochai Twitto
{"title":"CHAMP: A multipass algorithm for Max Sat based on saver variables","authors":"Daniel Berend ,&nbsp;Shahar Golan ,&nbsp;Yochai Twitto","doi":"10.1016/j.disopt.2023.100760","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper, we introduce the concept of saver variables in Max Sat and demonstrate their contribution to the performance of solvers for this problem. We present two types of saver variables: high-rank savers and consensual savers. We show how to incorporate them in various ways into an iterated algorithm, CHAMP, for Max Sat. We conduct an extensive empirical evaluation on two collections of instances — instances from a past Max Sat competition and random instances. It turns out that, by using savers, the number of unsatisfied clauses may be reduced by more than 70% in some families. Moreover, a refined version CHAMP+ of CHAMP improves the results even further. We show that by combining CHAMP+ with CCLS, a state-of-the-art solver, we obtain better solutions for many Max Sat instances.</p></div>","PeriodicalId":50571,"journal":{"name":"Discrete Optimization","volume":null,"pages":null},"PeriodicalIF":0.9000,"publicationDate":"2023-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Optimization","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1572528623000026","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we introduce the concept of saver variables in Max Sat and demonstrate their contribution to the performance of solvers for this problem. We present two types of saver variables: high-rank savers and consensual savers. We show how to incorporate them in various ways into an iterated algorithm, CHAMP, for Max Sat. We conduct an extensive empirical evaluation on two collections of instances — instances from a past Max Sat competition and random instances. It turns out that, by using savers, the number of unsatisfied clauses may be reduced by more than 70% in some families. Moreover, a refined version CHAMP+ of CHAMP improves the results even further. We show that by combining CHAMP+ with CCLS, a state-of-the-art solver, we obtain better solutions for many Max Sat instances.

CHAMP:基于节省器变量的Max Sat多通道算法
在本文中,我们在Max Sat中引入了saver变量的概念,并展示了它们对该问题求解器性能的贡献。我们提出了两种类型的储蓄变量:高级储蓄者和自愿储蓄者。我们展示了如何以各种方式将它们合并到Max Sat的迭代算法CHAMP中。我们对两组实例进行了广泛的实证评估——过去Max Sat竞赛的实例和随机实例。事实证明,通过使用储蓄者,一些家庭中未满足条款的数量可能会减少70%以上。此外,CHAMP的改进版CHAMP+进一步改进了结果。我们表明,通过将CHAMP+与最先进的求解器CCLS相结合,我们可以为许多Max Sat实例获得更好的解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Discrete Optimization
Discrete Optimization 管理科学-应用数学
CiteScore
2.10
自引率
9.10%
发文量
30
审稿时长
>12 weeks
期刊介绍: Discrete Optimization publishes research papers on the mathematical, computational and applied aspects of all areas of integer programming and combinatorial optimization. In addition to reports on mathematical results pertinent to discrete optimization, the journal welcomes submissions on algorithmic developments, computational experiments, and novel applications (in particular, large-scale and real-time applications). The journal also publishes clearly labelled surveys, reviews, short notes, and open problems. Manuscripts submitted for possible publication to Discrete Optimization should report on original research, should not have been previously published, and should not be under consideration for publication by any other journal.
×
引用
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学术官方微信