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

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

筛选
英文 中文
Reducing Bit-Vector Polynomials to SAT Using Gröbner Bases 使用Gröbner基减少位向量多项式到SAT
Theory and Applications of Satisfiability Testing – SAT 2020 Pub Date : 2020-06-26 DOI: 10.1007/978-3-030-51825-7_26
Thomas Seed, A. King, Neil Evans
{"title":"Reducing Bit-Vector Polynomials to SAT Using Gröbner Bases","authors":"Thomas Seed, A. King, Neil Evans","doi":"10.1007/978-3-030-51825-7_26","DOIUrl":"https://doi.org/10.1007/978-3-030-51825-7_26","url":null,"abstract":"","PeriodicalId":424049,"journal":{"name":"Theory and Applications of Satisfiability Testing – SAT 2020","volume":"14 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":"126858784","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
SAT-Based Encodings for Optimal Decision Trees with Explicit Paths 基于sat的显式路径最优决策树编码
Theory and Applications of Satisfiability Testing – SAT 2020 Pub Date : 2020-06-26 DOI: 10.1007/978-3-030-51825-7_35
Mikoláš Janota, António Morgado
{"title":"SAT-Based Encodings for Optimal Decision Trees with Explicit Paths","authors":"Mikoláš Janota, António Morgado","doi":"10.1007/978-3-030-51825-7_35","DOIUrl":"https://doi.org/10.1007/978-3-030-51825-7_35","url":null,"abstract":"","PeriodicalId":424049,"journal":{"name":"Theory and Applications of Satisfiability Testing – SAT 2020","volume":"19 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":"114067854","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}
引用次数: 22
A Lower Bound on DNNF Encodings of Pseudo-Boolean Constraints 伪布尔约束下DNNF编码的下界
Theory and Applications of Satisfiability Testing – SAT 2020 Pub Date : 2020-06-26 DOI: 10.1007/978-3-030-51825-7_22
Alexis de Colnet
{"title":"A Lower Bound on DNNF Encodings of Pseudo-Boolean Constraints","authors":"Alexis de Colnet","doi":"10.1007/978-3-030-51825-7_22","DOIUrl":"https://doi.org/10.1007/978-3-030-51825-7_22","url":null,"abstract":"","PeriodicalId":424049,"journal":{"name":"Theory and Applications of Satisfiability Testing – SAT 2020","volume":"19 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":"125154384","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
Distributed Cube and Conquer with Paracooba 分布式立方体和征服与Paracooba
Theory and Applications of Satisfiability Testing – SAT 2020 Pub Date : 2020-06-26 DOI: 10.1007/978-3-030-51825-7_9
Maximilian Heisinger, M. Fleury, Armin Biere
{"title":"Distributed Cube and Conquer with Paracooba","authors":"Maximilian Heisinger, M. Fleury, Armin Biere","doi":"10.1007/978-3-030-51825-7_9","DOIUrl":"https://doi.org/10.1007/978-3-030-51825-7_9","url":null,"abstract":"","PeriodicalId":424049,"journal":{"name":"Theory and Applications of Satisfiability Testing – SAT 2020","volume":"20 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":"132979432","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
Strong (D)QBF Dependency Schemes via Tautology-Free Resolution Paths 基于无同义分解路径的强(D)QBF依赖方案
Theory and Applications of Satisfiability Testing – SAT 2020 Pub Date : 2020-06-26 DOI: 10.1007/978-3-030-51825-7_28
Olaf Beyersdorff, Joshua Blinkhorn, Tomáš Peitl
{"title":"Strong (D)QBF Dependency Schemes via Tautology-Free Resolution Paths","authors":"Olaf Beyersdorff, Joshua Blinkhorn, Tomáš Peitl","doi":"10.1007/978-3-030-51825-7_28","DOIUrl":"https://doi.org/10.1007/978-3-030-51825-7_28","url":null,"abstract":"","PeriodicalId":424049,"journal":{"name":"Theory and Applications of Satisfiability Testing – SAT 2020","volume":"362 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":"122811942","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
Equivalence Between Systems Stronger Than Resolution 系统间的等价性强于分辨率
Theory and Applications of Satisfiability Testing – SAT 2020 Pub Date : 2020-06-26 DOI: 10.1007/978-3-030-51825-7_13
Maria Luisa Bonet, Jordi Levy
{"title":"Equivalence Between Systems Stronger Than Resolution","authors":"Maria Luisa Bonet, Jordi Levy","doi":"10.1007/978-3-030-51825-7_13","DOIUrl":"https://doi.org/10.1007/978-3-030-51825-7_13","url":null,"abstract":"","PeriodicalId":424049,"journal":{"name":"Theory and Applications of Satisfiability Testing – SAT 2020","volume":"29 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":"114532078","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
Reasoning About Strong Inconsistency in ASP 关于ASP中强不一致性的推理
Theory and Applications of Satisfiability Testing – SAT 2020 Pub Date : 2020-06-26 DOI: 10.1007/978-3-030-51825-7_24
Carlos Mencía, Joao Marques-Silva
{"title":"Reasoning About Strong Inconsistency in ASP","authors":"Carlos Mencía, Joao Marques-Silva","doi":"10.1007/978-3-030-51825-7_24","DOIUrl":"https://doi.org/10.1007/978-3-030-51825-7_24","url":null,"abstract":"","PeriodicalId":424049,"journal":{"name":"Theory and Applications of Satisfiability Testing – SAT 2020","volume":"49 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":"122827397","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
Four Flavors of Entailment 四种口味的蕴涵
Theory and Applications of Satisfiability Testing – SAT 2020 Pub Date : 2020-06-26 DOI: 10.1007/978-3-030-51825-7_5
Sibylle Möhle, R. Sebastiani, Armin Biere
{"title":"Four Flavors of Entailment","authors":"Sibylle Möhle, R. Sebastiani, Armin Biere","doi":"10.1007/978-3-030-51825-7_5","DOIUrl":"https://doi.org/10.1007/978-3-030-51825-7_5","url":null,"abstract":"","PeriodicalId":424049,"journal":{"name":"Theory and Applications of Satisfiability Testing – SAT 2020","volume":"150 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":"117329242","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
Trail Saving on Backtrack 在Backtrack上保存踪迹
Theory and Applications of Satisfiability Testing – SAT 2020 Pub Date : 2020-06-26 DOI: 10.1007/978-3-030-51825-7_4
Randy Hickey, F. Bacchus
{"title":"Trail Saving on Backtrack","authors":"Randy Hickey, F. Bacchus","doi":"10.1007/978-3-030-51825-7_4","DOIUrl":"https://doi.org/10.1007/978-3-030-51825-7_4","url":null,"abstract":"","PeriodicalId":424049,"journal":{"name":"Theory and Applications of Satisfiability Testing – SAT 2020","volume":"2015 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":"128034109","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
Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology 用抽象、嵌套动态规划和数据库技术驯服高树宽
Theory and Applications of Satisfiability Testing – SAT 2020 Pub Date : 2020-06-26 DOI: 10.1007/978-3-030-51825-7_25
Markus Hecher, Patrick Thier, S. Woltran
{"title":"Taming High Treewidth with Abstraction, Nested Dynamic Programming, and Database Technology","authors":"Markus Hecher, Patrick Thier, S. Woltran","doi":"10.1007/978-3-030-51825-7_25","DOIUrl":"https://doi.org/10.1007/978-3-030-51825-7_25","url":null,"abstract":"","PeriodicalId":424049,"journal":{"name":"Theory and Applications of Satisfiability Testing – SAT 2020","volume":"12 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":"125150691","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
首页 上一页 下一页 尾页
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学术官方微信