从MaxCSP到部分MaxSAT编码的新见解

Josep Argelich, Alba Cabiscol, I. Lynce, F. Manyà
{"title":"从MaxCSP到部分MaxSAT编码的新见解","authors":"Josep Argelich, Alba Cabiscol, I. Lynce, F. Manyà","doi":"10.1109/ISMVL.2010.17","DOIUrl":null,"url":null,"abstract":"We analyze the existing encodings from MaxCSP into Partial MaxSAT, and report on a number of new insights that we have gained from our analysis, which can be summarized as follows: (i) the at-most-one (AMO) condition can be omitted in direct encodings from MaxCSP into Partial MaxSAT, and auxiliary variables are not needed; (ii) the sequential encoding of the cardinality constraint is, in fact, a reformulation of a regular encoding; (iii) the All Different constraint based on regular literals may be simplified; (iv) if we represent, in support encodings, the supporting values of a variable using intervals, then we can derive a genuine regular support encoding without exponential blowup; and (v) the Equal constraint admits a concise representation with regular signs.","PeriodicalId":447743,"journal":{"name":"2010 40th IEEE International Symposium on Multiple-Valued Logic","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"New Insights into Encodings from MaxCSP into Partial MaxSAT\",\"authors\":\"Josep Argelich, Alba Cabiscol, I. Lynce, F. Manyà\",\"doi\":\"10.1109/ISMVL.2010.17\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We analyze the existing encodings from MaxCSP into Partial MaxSAT, and report on a number of new insights that we have gained from our analysis, which can be summarized as follows: (i) the at-most-one (AMO) condition can be omitted in direct encodings from MaxCSP into Partial MaxSAT, and auxiliary variables are not needed; (ii) the sequential encoding of the cardinality constraint is, in fact, a reformulation of a regular encoding; (iii) the All Different constraint based on regular literals may be simplified; (iv) if we represent, in support encodings, the supporting values of a variable using intervals, then we can derive a genuine regular support encoding without exponential blowup; and (v) the Equal constraint admits a concise representation with regular signs.\",\"PeriodicalId\":447743,\"journal\":{\"name\":\"2010 40th IEEE International Symposium on Multiple-Valued Logic\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-05-26\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 40th IEEE International Symposium on Multiple-Valued Logic\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISMVL.2010.17\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 40th IEEE International Symposium on Multiple-Valued Logic","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISMVL.2010.17","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

我们分析了现有的MaxCSP到Partial MaxSAT的编码,并从分析中获得了一些新的见解,可以总结如下:(1)从MaxCSP到Partial MaxSAT的直接编码可以省略最多一个(AMO)条件,并且不需要辅助变量;(ii)基数约束的顺序编码实际上是正则编码的重新表述;(iii)基于正则文字的All Different约束可以简化;(4)如果在支持编码中用区间表示一个变量的支持值,那么我们就可以得到一个真正的正则支持编码,而不会出现指数膨胀;(v)相等约束允许用规则符号表示。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
New Insights into Encodings from MaxCSP into Partial MaxSAT
We analyze the existing encodings from MaxCSP into Partial MaxSAT, and report on a number of new insights that we have gained from our analysis, which can be summarized as follows: (i) the at-most-one (AMO) condition can be omitted in direct encodings from MaxCSP into Partial MaxSAT, and auxiliary variables are not needed; (ii) the sequential encoding of the cardinality constraint is, in fact, a reformulation of a regular encoding; (iii) the All Different constraint based on regular literals may be simplified; (iv) if we represent, in support encodings, the supporting values of a variable using intervals, then we can derive a genuine regular support encoding without exponential blowup; and (v) the Equal constraint admits a concise representation with regular signs.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信