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

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

筛选
英文 中文
Computing Maximum Unavoidable Subgraphs Using SAT Solvers 使用SAT求解器计算最大不可避免子图
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2016-07-05 DOI: 10.1007/978-3-319-40970-2_13
C. K. Cuong, Marijn J. H. Heule
{"title":"Computing Maximum Unavoidable Subgraphs Using SAT Solvers","authors":"C. K. Cuong, Marijn J. H. Heule","doi":"10.1007/978-3-319-40970-2_13","DOIUrl":"https://doi.org/10.1007/978-3-319-40970-2_13","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"433 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122803188","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
SpyBug: Automated Bug Detection in the Configuration Space of SAT Solvers SpyBug:在SAT求解器的配置空间中的自动错误检测
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2016-07-05 DOI: 10.1007/978-3-319-40970-2_36
Norbert Manthey, M. Lindauer
{"title":"SpyBug: Automated Bug Detection in the Configuration Space of SAT Solvers","authors":"Norbert Manthey, M. Lindauer","doi":"10.1007/978-3-319-40970-2_36","DOIUrl":"https://doi.org/10.1007/978-3-319-40970-2_36","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121917543","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
Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers CDCL SAT求解器的紧凑模型中时间和内存的权衡
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2016-07-05 DOI: 10.1007/978-3-319-40970-2_11
J. Elffers, Jan Johannsen, Massimo Lauria, Thomas Magnard, Jakob Nordström, Marc Vinyals
{"title":"Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers","authors":"J. Elffers, Jan Johannsen, Massimo Lauria, Thomas Magnard, Jakob Nordström, Marc Vinyals","doi":"10.1007/978-3-319-40970-2_11","DOIUrl":"https://doi.org/10.1007/978-3-319-40970-2_11","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":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130038033","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
Satisfiability via Smooth Pictures 通过平滑图片的满意度
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2016-07-05 DOI: 10.1007/978-3-319-40970-2_2
Mateus de Oliveira Oliveira
{"title":"Satisfiability via Smooth Pictures","authors":"Mateus de Oliveira Oliveira","doi":"10.1007/978-3-319-40970-2_2","DOIUrl":"https://doi.org/10.1007/978-3-319-40970-2_2","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122043220","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
Predicate Elimination for Preprocessing in First-Order Theorem Proving 一阶定理证明预处理中的谓词消去
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2016-07-05 DOI: 10.1007/978-3-319-40970-2_22
Z. Khasidashvili, Konstantin Korovin
{"title":"Predicate Elimination for Preprocessing in First-Order Theorem Proving","authors":"Z. Khasidashvili, Konstantin Korovin","doi":"10.1007/978-3-319-40970-2_22","DOIUrl":"https://doi.org/10.1007/978-3-319-40970-2_22","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"247 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122136321","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}
引用次数: 12
MCS Extraction with Sublinear Oracle Queries 基于亚线性Oracle查询的MCS提取
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2016-07-05 DOI: 10.1007/978-3-319-40970-2_21
Carlos Mencía, Alexey Ignatiev, Alessandro Previti, Joao Marques-Silva
{"title":"MCS Extraction with Sublinear Oracle Queries","authors":"Carlos Mencía, Alexey Ignatiev, Alessandro Previti, Joao Marques-Silva","doi":"10.1007/978-3-319-40970-2_21","DOIUrl":"https://doi.org/10.1007/978-3-319-40970-2_21","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":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123127583","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}
引用次数: 21
Non-prenex QBF Solving Using Abstraction 基于抽象的非前缀QBF求解
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2016-07-05 DOI: 10.1007/978-3-319-40970-2_24
Leander Tentrup
{"title":"Non-prenex QBF Solving Using Abstraction","authors":"Leander Tentrup","doi":"10.1007/978-3-319-40970-2_24","DOIUrl":"https://doi.org/10.1007/978-3-319-40970-2_24","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132650002","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}
引用次数: 38
Learning Rate Based Branching Heuristic for SAT Solvers 基于学习率的分支启发式SAT求解方法
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2016-07-05 DOI: 10.1007/978-3-319-40970-2_9
J. Liang, Vijay Ganesh, P. Poupart, K. Czarnecki
{"title":"Learning Rate Based Branching Heuristic for SAT Solvers","authors":"J. Liang, Vijay Ganesh, P. Poupart, K. Czarnecki","doi":"10.1007/978-3-319-40970-2_9","DOIUrl":"https://doi.org/10.1007/978-3-319-40970-2_9","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131237419","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}
引用次数: 170
Deciding Bit-Vector Formulas with mcSAT 用mcSAT确定位矢量公式
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2016-07-05 DOI: 10.1007/978-3-319-40970-2_16
Aleksandar Zeljić, C. Wintersteiger, Philipp Rümmer
{"title":"Deciding Bit-Vector Formulas with mcSAT","authors":"Aleksandar Zeljić, C. Wintersteiger, Philipp Rümmer","doi":"10.1007/978-3-319-40970-2_16","DOIUrl":"https://doi.org/10.1007/978-3-319-40970-2_16","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128302463","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}
引用次数: 33
Heuristic NPN Classification for Large Functions Using AIGs and LEXSAT 基于AIGs和LEXSAT的大型函数启发式NPN分类
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2016-07-05 DOI: 10.1007/978-3-319-40970-2_14
Mathias Soeken, A. Mishchenko, A. Petkovska, Baruch Sterin, P. Ienne, R. Brayton, G. Micheli
{"title":"Heuristic NPN Classification for Large Functions Using AIGs and LEXSAT","authors":"Mathias Soeken, A. Mishchenko, A. Petkovska, Baruch Sterin, P. Ienne, R. Brayton, G. Micheli","doi":"10.1007/978-3-319-40970-2_14","DOIUrl":"https://doi.org/10.1007/978-3-319-40970-2_14","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"119 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133523530","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
首页 上一页
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学术官方微信