Pub Date : 2020-06-26DOI: 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}
Pub Date : 2020-06-26DOI: 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}
Pub Date : 2020-06-26DOI: 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}
Pub Date : 2020-06-26DOI: 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}
Pub Date : 2020-06-26DOI: 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}
Pub Date : 2020-06-26DOI: 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}
Pub Date : 2020-06-02DOI: 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}
Yuval Filmus, M. Mahajan, Gaurav Sood, Marc Vinyals
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.
{"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}
Pub Date : 2020-05-11DOI: 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}
Pub Date : 2020-05-11DOI: 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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：