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

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

筛选
英文 中文
Fast and Flexible Probabilistic Model Counting 快速灵活的概率模型计数
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2018-07-09 DOI: 10.1007/978-3-319-94144-8_10
D. Achlioptas, Zayd Hammoudeh, P. Theodoropoulos
{"title":"Fast and Flexible Probabilistic Model Counting","authors":"D. Achlioptas, Zayd Hammoudeh, P. Theodoropoulos","doi":"10.1007/978-3-319-94144-8_10","DOIUrl":"https://doi.org/10.1007/978-3-319-94144-8_10","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123434528","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
Effective Use of SMT Solvers for Program Equivalence Checking Through Invariant-Sketching and Query-Decomposition 通过不变量草图和查询分解有效地利用SMT求解器进行程序等价性检查
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2018-07-09 DOI: 10.1007/978-3-319-94144-8_22
Shubhani Gupta, Aseem Saxena, Anmol Mahajan, Sorav Bansal
{"title":"Effective Use of SMT Solvers for Program Equivalence Checking Through Invariant-Sketching and Query-Decomposition","authors":"Shubhani Gupta, Aseem Saxena, Anmol Mahajan, Sorav Bansal","doi":"10.1007/978-3-319-94144-8_22","DOIUrl":"https://doi.org/10.1007/978-3-319-94144-8_22","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":"2018-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125651571","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
Finding All Minimal Safe Inductive Sets 求所有最小安全感应集
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2018-07-09 DOI: 10.1007/978-3-319-94144-8_21
Ryan Berryhill, A. Ivrii, A. Veneris
{"title":"Finding All Minimal Safe Inductive Sets","authors":"Ryan Berryhill, A. Ivrii, A. Veneris","doi":"10.1007/978-3-319-94144-8_21","DOIUrl":"https://doi.org/10.1007/978-3-319-94144-8_21","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"59 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133603081","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
Solving MaxSAT with Bit-Vector Optimization 用位向量优化求解MaxSAT
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2018-07-09 DOI: 10.1007/978-3-319-94144-8_4
Alexander Nadel
{"title":"Solving MaxSAT with Bit-Vector Optimization","authors":"Alexander Nadel","doi":"10.1007/978-3-319-94144-8_4","DOIUrl":"https://doi.org/10.1007/978-3-319-94144-8_4","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121183028","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}
引用次数: 10
ALIAS: A Modular Tool for Finding Backdoors for SAT 别名:为SAT寻找后门的模块化工具
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2018-07-09 DOI: 10.1007/978-3-319-94144-8_25
S. Kochemazov, O. Zaikin
{"title":"ALIAS: A Modular Tool for Finding Backdoors for SAT","authors":"S. Kochemazov, O. Zaikin","doi":"10.1007/978-3-319-94144-8_25","DOIUrl":"https://doi.org/10.1007/978-3-319-94144-8_25","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"72 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121125179","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}
引用次数: 9
Fast Sampling of Perfectly Uniform Satisfying Assignments 完全均匀满意赋值的快速抽样
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2018-07-09 DOI: 10.1007/978-3-319-94144-8_9
D. Achlioptas, Zayd Hammoudeh, P. Theodoropoulos
{"title":"Fast Sampling of Perfectly Uniform Satisfying Assignments","authors":"D. Achlioptas, Zayd Hammoudeh, P. Theodoropoulos","doi":"10.1007/978-3-319-94144-8_9","DOIUrl":"https://doi.org/10.1007/978-3-319-94144-8_9","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"51 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129040322","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}
引用次数: 34
Dependency Quantified Boolean Formulas: An Overview of Solution Methods and Applications - Extended Abstract 依赖量化布尔公式:解决方法和应用综述-扩展摘要
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2018-07-09 DOI: 10.1007/978-3-319-94144-8_1
Christoph Scholl, Ralf Wimmer
{"title":"Dependency Quantified Boolean Formulas: An Overview of Solution Methods and Applications - Extended Abstract","authors":"Christoph Scholl, Ralf Wimmer","doi":"10.1007/978-3-319-94144-8_1","DOIUrl":"https://doi.org/10.1007/978-3-319-94144-8_1","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121547107","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
Machine Learning-Based Restart Policy for CDCL SAT Solvers 基于机器学习的CDCL SAT解算器重启策略
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2018-07-09 DOI: 10.1007/978-3-319-94144-8_6
J. Liang, Chanseok Oh, Minu Mathew, Ciza Thomas, Chunxiao Li, Vijay Ganesh
{"title":"Machine Learning-Based Restart Policy for CDCL SAT Solvers","authors":"J. Liang, Chanseok Oh, Minu Mathew, Ciza Thomas, Chunxiao Li, Vijay Ganesh","doi":"10.1007/978-3-319-94144-8_6","DOIUrl":"https://doi.org/10.1007/978-3-319-94144-8_6","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"147 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133634619","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}
引用次数: 31
In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving 在分辨和切割平面之间:伪布尔SAT解的证明系统研究
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2018-07-09 DOI: 10.1007/978-3-319-94144-8_18
Marc Vinyals, J. Elffers, Jesús Giráldez-Cru, S. Gocht, Jakob Nordström
{"title":"In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving","authors":"Marc Vinyals, J. Elffers, Jesús Giráldez-Cru, S. Gocht, Jakob Nordström","doi":"10.1007/978-3-319-94144-8_18","DOIUrl":"https://doi.org/10.1007/978-3-319-94144-8_18","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"62 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132259315","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
Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers 用组合基准测试伪布尔解算器的推理能力
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2018-07-09 DOI: 10.1007/978-3-319-94144-8_5
J. Elffers, Jesús Giráldez-Cru, Jakob Nordström, Marc Vinyals
{"title":"Using Combinatorial Benchmarks to Probe the Reasoning Power of Pseudo-Boolean Solvers","authors":"J. Elffers, Jesús Giráldez-Cru, Jakob Nordström, Marc Vinyals","doi":"10.1007/978-3-319-94144-8_5","DOIUrl":"https://doi.org/10.1007/978-3-319-94144-8_5","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"157 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132401197","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}
引用次数: 19
首页 上一页 下一页 尾页
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学术官方微信