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

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

筛选
英文 中文
Matrix Multiplication: Verifying Strong Uniquely Solvable Puzzles 矩阵乘法:验证强唯一可解的谜题
Theory and Applications of Satisfiability Testing – SAT 2020 Pub Date : 2020-06-26 DOI: 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}
引用次数: 1
Sorting Parity Encodings by Reusing Variables 通过重用变量来排序奇偶校验编码
Theory and Applications of Satisfiability Testing – SAT 2020 Pub Date : 2020-06-26 DOI: 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}
引用次数: 8
Improving Implementation of SAT Competitions 2017–2019 Winners 改进2017-2019年SAT竞赛的实施
Theory and Applications of Satisfiability Testing – SAT 2020 Pub Date : 2020-06-26 DOI: 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}
引用次数: 4
Short Q-Resolution Proofs with Homomorphisms 具有同态的短q分辨证明
Theory and Applications of Satisfiability Testing – SAT 2020 Pub Date : 2020-06-26 DOI: 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}
引用次数: 0
A Faster Algorithm for Propositional Model Counting Parameterized by Incidence Treewidth 一种基于关联树宽度参数化的快速命题模型计数算法
Theory and Applications of Satisfiability Testing – SAT 2020 Pub Date : 2020-06-26 DOI: 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}
引用次数: 1
Simplified and Improved Separations Between Regular and General Resolution by Lifting 通过提升简化和改进常规分辨率和一般分辨率之间的分离
Theory and Applications of Satisfiability Testing – SAT 2020 Pub Date : 2020-06-26 DOI: 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}
引用次数: 2
Clause Size Reduction with all-UIP Learning 基于全uip学习的子句大小缩减
Theory and Applications of Satisfiability Testing – SAT 2020 Pub Date : 2020-06-26 DOI: 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}
引用次数: 11
Reproducible Efficient Parallel SAT Solving 可重复的高效并行SAT求解
Theory and Applications of Satisfiability Testing – SAT 2020 Pub Date : 2020-06-26 DOI: 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}
引用次数: 3
On the Sparsity of XORs in Approximate Model Counting 关于近似模型计数中xor的稀疏性
Theory and Applications of Satisfiability Testing – SAT 2020 Pub Date : 2020-06-26 DOI: 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}
引用次数: 2
Satisfiability Solving Meets Evolutionary Optimisation in Designing Approximate Circuits 近似电路设计中的可满足性求解与进化优化
Theory and Applications of Satisfiability Testing – SAT 2020 Pub Date : 2020-06-26 DOI: 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}
引用次数: 0
下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信