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

International Conference on Theory and Applications of Satisfiability Testing最新文献

筛选
英文 中文
Clausal Abstraction for DQBF DQBF的子句抽象
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2019-07-07 DOI: 10.1007/978-3-030-24258-9_27
Leander Tentrup, Markus N. Rabe
{"title":"Clausal Abstraction for DQBF","authors":"Leander Tentrup, Markus N. Rabe","doi":"10.1007/978-3-030-24258-9_27","DOIUrl":"https://doi.org/10.1007/978-3-030-24258-9_27","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127334223","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}
引用次数: 20
Proof Complexity of QBF Symmetry Recomputation QBF对称重计算的证明复杂性
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2019-07-07 DOI: 10.1007/978-3-030-24258-9_3
Joshua Blinkhorn, Olaf Beyersdorff
{"title":"Proof Complexity of QBF Symmetry Recomputation","authors":"Joshua Blinkhorn, Olaf Beyersdorff","doi":"10.1007/978-3-030-24258-9_3","DOIUrl":"https://doi.org/10.1007/978-3-030-24258-9_3","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115714637","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
Syntax-Guided Rewrite Rule Enumeration for SMT Solvers SMT求解器的语法引导重写规则枚举
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2019-07-07 DOI: 10.1007/978-3-030-24258-9_20
Andres Nötzli, Andrew Reynolds, Haniel Barbosa, Aina Niemetz, Mathias Preiner, Clark W. Barrett, C. Tinelli
{"title":"Syntax-Guided Rewrite Rule Enumeration for SMT Solvers","authors":"Andres Nötzli, Andrew Reynolds, Haniel Barbosa, Aina Niemetz, Mathias Preiner, Clark W. Barrett, C. Tinelli","doi":"10.1007/978-3-030-24258-9_20","DOIUrl":"https://doi.org/10.1007/978-3-030-24258-9_20","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128020240","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}
引用次数: 24
DRAT Proofs, Propagation Redundancy, and Extended Resolution 草稿证明、传播冗余和扩展分辨率
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2019-07-07 DOI: 10.1007/978-3-030-24258-9_5
S. Buss, Neil Thapen
{"title":"DRAT Proofs, Propagation Redundancy, and Extended Resolution","authors":"S. Buss, Neil Thapen","doi":"10.1007/978-3-030-24258-9_5","DOIUrl":"https://doi.org/10.1007/978-3-030-24258-9_5","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131827864","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}
引用次数: 14
Proof Complexity of Fragments of Long-Distance Q-Resolution 远距离q分辨片段的证明复杂度
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2019-07-07 DOI: 10.1007/978-3-030-24258-9_23
Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider
{"title":"Proof Complexity of Fragments of Long-Distance Q-Resolution","authors":"Tomáš Peitl, Friedrich Slivovsky, Stefan Szeider","doi":"10.1007/978-3-030-24258-9_23","DOIUrl":"https://doi.org/10.1007/978-3-030-24258-9_23","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121337877","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
On Super Strong ETH 关于超强ETH
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2019-07-07 DOI: 10.1007/978-3-030-24258-9_28
Nikhil Vyas, Richard Ryan Williams
{"title":"On Super Strong ETH","authors":"Nikhil Vyas, Richard Ryan Williams","doi":"10.1007/978-3-030-24258-9_28","DOIUrl":"https://doi.org/10.1007/978-3-030-24258-9_28","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133153351","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
DRAT-based Bit-Vector Proofs in CVC4 基于drat的位向量证明在CVC4
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2019-06-28 DOI: 10.1007/978-3-030-24258-9_21
Alex Ozdemir, Aina Niemetz, Mathias Preiner, Yoni Zohar, Clark W. Barrett
{"title":"DRAT-based Bit-Vector Proofs in CVC4","authors":"Alex Ozdemir, Aina Niemetz, Mathias Preiner, Yoni Zohar, Clark W. Barrett","doi":"10.1007/978-3-030-24258-9_21","DOIUrl":"https://doi.org/10.1007/978-3-030-24258-9_21","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124085066","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
Revisiting Graph Width Measures for CNF-Encodings 重新审视cnf编码的图宽度度量
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2019-05-09 DOI: 10.1007/978-3-030-24258-9_16
S. Mengel, Romain Wallon
{"title":"Revisiting Graph Width Measures for CNF-Encodings","authors":"S. Mengel, Romain Wallon","doi":"10.1007/978-3-030-24258-9_16","DOIUrl":"https://doi.org/10.1007/978-3-030-24258-9_16","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127104124","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
Local Search for Fast Matrix Multiplication 快速矩阵乘法的局部搜索
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2019-03-27 DOI: 10.1007/978-3-030-24258-9_10
Marijn J. H. Heule, Manuel Kauers, M. Seidl
{"title":"Local Search for Fast Matrix Multiplication","authors":"Marijn J. H. Heule, Manuel Kauers, M. Seidl","doi":"10.1007/978-3-030-24258-9_10","DOIUrl":"https://doi.org/10.1007/978-3-030-24258-9_10","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125802291","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}
引用次数: 15
Guiding High-Performance SAT Solvers with Unsat-Core Predictions 指导高性能SAT求解与unsat核心预测
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2019-03-12 DOI: 10.1007/978-3-030-24258-9_24
Daniel Selsam, N. Bjørner
{"title":"Guiding High-Performance SAT Solvers with Unsat-Core Predictions","authors":"Daniel Selsam, N. Bjørner","doi":"10.1007/978-3-030-24258-9_24","DOIUrl":"https://doi.org/10.1007/978-3-030-24258-9_24","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-03-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131137315","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}
引用次数: 89
首页 上一页 下一页 尾页
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学术官方微信