发布求助
文献互助 智能选刊 最新文献

Theory and Applications of Satisfiability Testing – SAT 2020最新文献

筛选
英文 中文
Community and LBD-Based Clause Sharing Policy for Parallel SAT Solving 基于社区和lbd的并行SAT分句共享策略
Theory and Applications of Satisfiability Testing – SAT 2020 Pub Date : 2020-06-26 DOI: 10.1007/978-3-030-51825-7_2
Vincent Vallade, Ludovic Le Frioux, S. Baarir, Julien Sopena, Vijay Ganesh, F. Kordon
{"title":"Community and LBD-Based Clause Sharing Policy for Parallel SAT Solving","authors":"Vincent Vallade, Ludovic Le Frioux, S. Baarir, Julien Sopena, Vijay Ganesh, F. Kordon","doi":"10.1007/978-3-030-51825-7_2","DOIUrl":"https://doi.org/10.1007/978-3-030-51825-7_2","url":null,"abstract":"","PeriodicalId":424049,"journal":{"name":"Theory and Applications of Satisfiability Testing – SAT 2020","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130108928","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Abstract Cores in Implicit Hitting Set MaxSat Solving 隐式命中集MaxSat求解中的抽象核
Theory and Applications of Satisfiability Testing – SAT 2020 Pub Date : 2020-06-26 DOI: 10.1007/978-3-030-51825-7_20
J. Berg, F. Bacchus, Alex Poole
{"title":"Abstract Cores in Implicit Hitting Set MaxSat Solving","authors":"J. Berg, F. Bacchus, Alex Poole","doi":"10.1007/978-3-030-51825-7_20","DOIUrl":"https://doi.org/10.1007/978-3-030-51825-7_20","url":null,"abstract":"","PeriodicalId":424049,"journal":{"name":"Theory and Applications of Satisfiability Testing – SAT 2020","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131541523","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 13
Multi-linear Strategy Extraction for QBF Expansion Proofs via Local Soundness 基于局部稳健性的QBF展开证明的多线性策略提取
Theory and Applications of Satisfiability Testing – SAT 2020 Pub Date : 2020-06-26 DOI: 10.1007/978-3-030-51825-7_30
Matthias Schlaipfer, Friedrich Slivovsky, Georg Weissenbacher, Florian Zuleger
{"title":"Multi-linear Strategy Extraction for QBF Expansion Proofs via Local Soundness","authors":"Matthias Schlaipfer, Friedrich Slivovsky, Georg Weissenbacher, Florian Zuleger","doi":"10.1007/978-3-030-51825-7_30","DOIUrl":"https://doi.org/10.1007/978-3-030-51825-7_30","url":null,"abstract":"","PeriodicalId":424049,"journal":{"name":"Theory and Applications of Satisfiability Testing – SAT 2020","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130551400","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Incremental Encoding of Pseudo-Boolean Goal Functions Based on Comparator Networks 基于比较器网络的伪布尔目标函数增量编码
Theory and Applications of Satisfiability Testing – SAT 2020 Pub Date : 2020-06-26 DOI: 10.1007/978-3-030-51825-7_36
Michał Karpiński, M. Piotrów
{"title":"Incremental Encoding of Pseudo-Boolean Goal Functions Based on Comparator Networks","authors":"Michał Karpiński, M. Piotrów","doi":"10.1007/978-3-030-51825-7_36","DOIUrl":"https://doi.org/10.1007/978-3-030-51825-7_36","url":null,"abstract":"","PeriodicalId":424049,"journal":{"name":"Theory and Applications of Satisfiability Testing – SAT 2020","volume":"143 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128750201","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
SAT Solving with Fragmented Hamiltonian Path Constraints for Wire Arc Additive Manufacturing 基于碎片哈密顿路径约束的弧线增材制造SAT求解
Theory and Applications of Satisfiability Testing – SAT 2020 Pub Date : 2020-06-26 DOI: 10.1007/978-3-030-51825-7_34
Rüdiger Ehlers, K. Treutler, V. Wesling
{"title":"SAT Solving with Fragmented Hamiltonian Path Constraints for Wire Arc Additive Manufacturing","authors":"Rüdiger Ehlers, K. Treutler, V. Wesling","doi":"10.1007/978-3-030-51825-7_34","DOIUrl":"https://doi.org/10.1007/978-3-030-51825-7_34","url":null,"abstract":"","PeriodicalId":424049,"journal":{"name":"Theory and Applications of Satisfiability Testing – SAT 2020","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115665634","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Speeding up Quantified Bit-Vector SMT Solvers by Bit-Width Reductions and Extensions 用位宽约简和扩展加速量化位矢量SMT求解
Theory and Applications of Satisfiability Testing – SAT 2020 Pub Date : 2020-06-26 DOI: 10.1007/978-3-030-51825-7_27
Martin Jonás, J. Strejček
{"title":"Speeding up Quantified Bit-Vector SMT Solvers by Bit-Width Reductions and Extensions","authors":"Martin Jonás, J. Strejček","doi":"10.1007/978-3-030-51825-7_27","DOIUrl":"https://doi.org/10.1007/978-3-030-51825-7_27","url":null,"abstract":"","PeriodicalId":424049,"journal":{"name":"Theory and Applications of Satisfiability Testing – SAT 2020","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122222657","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
SAT Heritage: A Community-Driven Effort for Archiving, Building and Running More Than Thousand SAT Solvers SAT遗产:一个社区驱动的努力，用于存档，构建和运行超过1000个SAT解决方案
Theory and Applications of Satisfiability Testing – SAT 2020 Pub Date : 2020-06-02 DOI: 10.1007/978-3-030-51825-7_8
Gilles Audemard, Loïc Paulevé, Laurent Simon
{"title":"SAT Heritage: A Community-Driven Effort for Archiving, Building and Running More Than Thousand SAT Solvers","authors":"Gilles Audemard, Loïc Paulevé, Laurent Simon","doi":"10.1007/978-3-030-51825-7_8","DOIUrl":"https://doi.org/10.1007/978-3-030-51825-7_8","url":null,"abstract":"","PeriodicalId":424049,"journal":{"name":"Theory and Applications of Satisfiability Testing – SAT 2020","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115059116","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
MaxSAT Resolution and Subcube Sums MaxSAT分辨率和子立方体和
Theory and Applications of Satisfiability Testing – SAT 2020 Pub Date : 2020-05-23 DOI: 10.1145/3565363
Yuval Filmus, M. Mahajan, Gaurav Sood, Marc Vinyals
{"title":"MaxSAT Resolution and Subcube Sums","authors":"Yuval Filmus, M. Mahajan, Gaurav Sood, Marc Vinyals","doi":"10.1145/3565363","DOIUrl":"https://doi.org/10.1145/3565363","url":null,"abstract":"We study the MaxSAT Resolution (MaxRes) rule in the context of certifying unsatisfiability. We show that it can be exponentially more powerful than tree-like resolution, and when augmented with weakening (the system MaxResW), p-simulates tree-like resolution. In devising a lower bound technique specific to MaxRes (and not merely inheriting lower bounds from Res), we define a new proof system called the SubCubeSums proof system. This system, which p-simulates MaxResW, can be viewed as a special case of the semi-algebraic Sherali–Adams proof system. In expressivity, it is the integral restriction of conical juntas studied in the contexts of communication complexity and extension complexity. We show that it is not simulated by Res. Using a proof technique qualitatively different from the lower bounds that MaxResW inherits from Res, we show that Tseitin contradictions on expander graphs are hard to refute in SubCubeSums. We also establish a lower bound technique via lifting: for formulas requiring large degree in SubCubeSums, their XOR-ification requires large size in SubCubeSums.","PeriodicalId":424049,"journal":{"name":"Theory and Applications of Satisfiability Testing – SAT 2020","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132138642","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
Designing New Phase Selection Heuristics 设计新的阶段选择启发式方法
Theory and Applications of Satisfiability Testing – SAT 2020 Pub Date : 2020-05-11 DOI: 10.1007/978-3-030-51825-7_6
Arijit Shaw, Kuldeep S. Meel
{"title":"Designing New Phase Selection Heuristics","authors":"Arijit Shaw, Kuldeep S. Meel","doi":"10.1007/978-3-030-51825-7_6","DOIUrl":"https://doi.org/10.1007/978-3-030-51825-7_6","url":null,"abstract":"","PeriodicalId":424049,"journal":{"name":"Theory and Applications of Satisfiability Testing – SAT 2020","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133073836","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Positional Games and QBF: The Corrective Encoding 位置博弈与QBF:校正编码
Theory and Applications of Satisfiability Testing – SAT 2020 Pub Date : 2020-05-11 DOI: 10.1007/978-3-030-51825-7_31
V. Mayer-Eichberger, Abdallah Saffidine
{"title":"Positional Games and QBF: The Corrective Encoding","authors":"V. Mayer-Eichberger, Abdallah Saffidine","doi":"10.1007/978-3-030-51825-7_31","DOIUrl":"https://doi.org/10.1007/978-3-030-51825-7_31","url":null,"abstract":"","PeriodicalId":424049,"journal":{"name":"Theory and Applications of Satisfiability Testing – SAT 2020","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124578527","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信