Pub Date : 2020-06-26DOI: 10.1007/978-3-030-51825-7_32
Matthew W. Anderson, Zongliang Ji, Anthony Yang Xu
{"title":"Matrix Multiplication: Verifying Strong Uniquely Solvable Puzzles","authors":"Matthew W. Anderson, Zongliang Ji, Anthony Yang Xu","doi":"10.1007/978-3-030-51825-7_32","DOIUrl":"https://doi.org/10.1007/978-3-030-51825-7_32","url":null,"abstract":"","PeriodicalId":424049,"journal":{"name":"Theory and Applications of Satisfiability Testing – SAT 2020","volume":"24 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":"133174258","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_1
Leroy Chew, Marijn J. H. Heule
{"title":"Sorting Parity Encodings by Reusing Variables","authors":"Leroy Chew, Marijn J. H. Heule","doi":"10.1007/978-3-030-51825-7_1","DOIUrl":"https://doi.org/10.1007/978-3-030-51825-7_1","url":null,"abstract":"","PeriodicalId":424049,"journal":{"name":"Theory and Applications of Satisfiability Testing – SAT 2020","volume":"12178 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":"131294646","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_11
S. Kochemazov
{"title":"Improving Implementation of SAT Competitions 2017–2019 Winners","authors":"S. Kochemazov","doi":"10.1007/978-3-030-51825-7_11","DOIUrl":"https://doi.org/10.1007/978-3-030-51825-7_11","url":null,"abstract":"","PeriodicalId":424049,"journal":{"name":"Theory and Applications of Satisfiability Testing – SAT 2020","volume":"27 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":"117096933","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_29
Ankit Shukla, Friedrich Slivovsky, Stefan Szeider
{"title":"Short Q-Resolution Proofs with Homomorphisms","authors":"Ankit Shukla, Friedrich Slivovsky, Stefan Szeider","doi":"10.1007/978-3-030-51825-7_29","DOIUrl":"https://doi.org/10.1007/978-3-030-51825-7_29","url":null,"abstract":"","PeriodicalId":424049,"journal":{"name":"Theory and Applications of Satisfiability Testing – SAT 2020","volume":"24 44","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113955393","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_19
Friedrich Slivovsky, Stefan Szeider
{"title":"A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth","authors":"Friedrich Slivovsky, Stefan Szeider","doi":"10.1007/978-3-030-51825-7_19","DOIUrl":"https://doi.org/10.1007/978-3-030-51825-7_19","url":null,"abstract":"","PeriodicalId":424049,"journal":{"name":"Theory and Applications of Satisfiability Testing – SAT 2020","volume":"30 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":"131830973","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_14
Marc Vinyals, J. Elffers, Jan Johannsen, Jakob Nordström
{"title":"Simplified and Improved Separations Between Regular and General Resolution by Lifting","authors":"Marc Vinyals, J. Elffers, Jan Johannsen, Jakob Nordström","doi":"10.1007/978-3-030-51825-7_14","DOIUrl":"https://doi.org/10.1007/978-3-030-51825-7_14","url":null,"abstract":"","PeriodicalId":424049,"journal":{"name":"Theory and Applications of Satisfiability Testing – SAT 2020","volume":"1 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":"133202042","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_3
Nick Feng, F. Bacchus
{"title":"Clause Size Reduction with all-UIP Learning","authors":"Nick Feng, F. Bacchus","doi":"10.1007/978-3-030-51825-7_3","DOIUrl":"https://doi.org/10.1007/978-3-030-51825-7_3","url":null,"abstract":"","PeriodicalId":424049,"journal":{"name":"Theory and Applications of Satisfiability Testing – SAT 2020","volume":"435 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":"116011007","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_10
H. Nabeshima, Katsumi Inoue
{"title":"Reproducible Efficient Parallel SAT Solving","authors":"H. Nabeshima, Katsumi Inoue","doi":"10.1007/978-3-030-51825-7_10","DOIUrl":"https://doi.org/10.1007/978-3-030-51825-7_10","url":null,"abstract":"","PeriodicalId":424049,"journal":{"name":"Theory and Applications of Satisfiability Testing – SAT 2020","volume":"39 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":"134031689","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_18
Durgesh Kumar Agrawal, Bhavishya, Kuldeep S. Meel
{"title":"On the Sparsity of XORs in Approximate Model Counting","authors":"Durgesh Kumar Agrawal, Bhavishya, Kuldeep S. Meel","doi":"10.1007/978-3-030-51825-7_18","DOIUrl":"https://doi.org/10.1007/978-3-030-51825-7_18","url":null,"abstract":"","PeriodicalId":424049,"journal":{"name":"Theory and Applications of Satisfiability Testing – SAT 2020","volume":"18 9","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132791207","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_33
Milan Ceska, Jiří Matyáš, Vojtěch Mrázek, Tomáš Vojnar
{"title":"Satisfiability Solving Meets Evolutionary Optimisation in Designing Approximate Circuits","authors":"Milan Ceska, Jiří Matyáš, Vojtěch Mrázek, Tomáš Vojnar","doi":"10.1007/978-3-030-51825-7_33","DOIUrl":"https://doi.org/10.1007/978-3-030-51825-7_33","url":null,"abstract":"","PeriodicalId":424049,"journal":{"name":"Theory and Applications of Satisfiability Testing – SAT 2020","volume":"50 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":"127586918","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
扫码关注我们
求助内容：
应助结果提醒方式：