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

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

筛选
英文 中文
PySAT: A Python Toolkit for Prototyping with SAT Oracles PySAT:一个使用SAT oracle进行原型设计的Python工具包
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2018-07-09 DOI: 10.1007/978-3-319-94144-8_26
Alexey Ignatiev, António Morgado, Joao Marques-Silva
{"title":"PySAT: A Python Toolkit for Prototyping with SAT Oracles","authors":"Alexey Ignatiev, António Morgado, Joao Marques-Silva","doi":"10.1007/978-3-319-94144-8_26","DOIUrl":"https://doi.org/10.1007/978-3-319-94144-8_26","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"48 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":"123424533","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}
引用次数: 186
Dynamic Polynomial Watchdog Encoding for Solving Weighted MaxSAT 求解加权MaxSAT的动态多项式看门狗编码
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2018-07-09 DOI: 10.1007/978-3-319-94144-8_3
Tobias Paxian, Sven Reimer, B. Becker
{"title":"Dynamic Polynomial Watchdog Encoding for Solving Weighted MaxSAT","authors":"Tobias Paxian, Sven Reimer, B. Becker","doi":"10.1007/978-3-319-94144-8_3","DOIUrl":"https://doi.org/10.1007/978-3-319-94144-8_3","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"86 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":"127196605","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}
引用次数: 17
Local Soundness for QBF Calculi QBF微积分的局部健全性
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2018-07-09 DOI: 10.1007/978-3-319-94144-8_14
M. Suda, Bernhard Gleiss
{"title":"Local Soundness for QBF Calculi","authors":"M. Suda, Bernhard Gleiss","doi":"10.1007/978-3-319-94144-8_14","DOIUrl":"https://doi.org/10.1007/978-3-319-94144-8_14","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":"128789229","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}
引用次数: 5
Circuit-Based Search Space Pruning in QBF 基于电路的QBF搜索空间剪枝
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2018-07-09 DOI: 10.1007/978-3-319-94144-8_12
Mikoláš Janota
{"title":"Circuit-Based Search Space Pruning in QBF","authors":"Mikoláš Janota","doi":"10.1007/978-3-319-94144-8_12","DOIUrl":"https://doi.org/10.1007/978-3-319-94144-8_12","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"24 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":"121408056","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
Experimenting on Solving Nonlinear Integer Arithmetic with Incremental Linearization 用增量线性化方法求解非线性整数算法的实验
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2018-07-09 DOI: 10.1007/978-3-319-94144-8_23
A. Cimatti, A. Griggio, A. Irfan, Marco Roveri, R. Sebastiani
{"title":"Experimenting on Solving Nonlinear Integer Arithmetic with Incremental Linearization","authors":"A. Cimatti, A. Griggio, A. Irfan, Marco Roveri, R. Sebastiani","doi":"10.1007/978-3-319-94144-8_23","DOIUrl":"https://doi.org/10.1007/978-3-319-94144-8_23","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"44 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":"131815927","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
XOR-Satisfiability Set Membership Filters xor可满足集成员过滤器
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2018-07-09 DOI: 10.1007/978-3-319-94144-8_24
S. Weaver, Hannah J. Roberts, Michael J. Smith
{"title":"XOR-Satisfiability Set Membership Filters","authors":"S. Weaver, Hannah J. Roberts, Michael J. Smith","doi":"10.1007/978-3-319-94144-8_24","DOIUrl":"https://doi.org/10.1007/978-3-319-94144-8_24","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"153 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":"134263848","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}
引用次数: 6
Approximately Propagation Complete and Conflict Propagating Constraint Encodings 近似传播完备和冲突传播约束编码
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2018-07-09 DOI: 10.1007/978-3-319-94144-8_2
Rüdiger Ehlers, F. P. Romero
{"title":"Approximately Propagation Complete and Conflict Propagating Constraint Encodings","authors":"Rüdiger Ehlers, F. P. Romero","doi":"10.1007/978-3-319-94144-8_2","DOIUrl":"https://doi.org/10.1007/978-3-319-94144-8_2","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"75 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":"114687305","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
Centrality-Based Improvements to CDCL Heuristics 基于中心性的CDCL启发式改进
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2018-07-09 DOI: 10.1007/978-3-319-94144-8_8
S. Jamali, D. Mitchell
{"title":"Centrality-Based Improvements to CDCL Heuristics","authors":"S. Jamali, D. Mitchell","doi":"10.1007/978-3-319-94144-8_8","DOIUrl":"https://doi.org/10.1007/978-3-319-94144-8_8","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"65 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":"122809176","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
Minimal Unsatisfiability and Minimal Strongly Connected Digraphs 最小不满足和最小强连通有向图
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2018-07-09 DOI: 10.1007/978-3-319-94144-8_20
H. Abbasizanjani, O. Kullmann
{"title":"Minimal Unsatisfiability and Minimal Strongly Connected Digraphs","authors":"H. Abbasizanjani, O. Kullmann","doi":"10.1007/978-3-319-94144-8_20","DOIUrl":"https://doi.org/10.1007/978-3-319-94144-8_20","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"38 8 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":"121170993","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}
引用次数: 5
Sharpness of the Satisfiability Threshold for Non-uniform Random k-SAT 非均匀随机k-SAT可满足阈值的清晰度
International Conference on Theory and Applications of Satisfiability Testing Pub Date : 2018-07-09 DOI: 10.1007/978-3-319-94144-8_17
T. Friedrich, Ralf Rothenberger
{"title":"Sharpness of the Satisfiability Threshold for Non-uniform Random k-SAT","authors":"T. Friedrich, Ralf Rothenberger","doi":"10.1007/978-3-319-94144-8_17","DOIUrl":"https://doi.org/10.1007/978-3-319-94144-8_17","url":null,"abstract":"","PeriodicalId":446175,"journal":{"name":"International Conference on Theory and Applications of Satisfiability Testing","volume":"182 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":"114554216","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
首页 上一页 下一页 尾页
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学术官方微信