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

Journal of Automated Reasoning最新文献

筛选
英文 中文
Proof Complexity of Modal Resolution. 证明模态分辨率的复杂性。
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2022-01-01 Epub Date: 2021-10-13 DOI: 10.1007/s10817-021-09609-9
Sarah Sigley, Olaf Beyersdorff
{"title":"Proof Complexity of Modal Resolution.","authors":"Sarah Sigley,&nbsp;Olaf Beyersdorff","doi":"10.1007/s10817-021-09609-9","DOIUrl":"https://doi.org/10.1007/s10817-021-09609-9","url":null,"abstract":"<p><p>We investigate the proof complexity of modal resolution systems developed by Nalon and Dixon (J Algorithms 62(3-4):117-134, 2007) and Nalon et al. (in: Automated reasoning with analytic Tableaux and related methods-24th international conference, (TABLEAUX'15), pp 185-200, 2015), which form the basis of modal theorem proving (Nalon et al., in: Proceedings of the twenty-sixth international joint conference on artificial intelligence (IJCAI'17), pp 4919-4923, 2017). We complement these calculi by a new tighter variant and show that proofs can be efficiently translated between all these variants, meaning that the calculi are equivalent from a proof complexity perspective. We then develop the first lower bound technique for modal resolution using Prover-Delayer games, which can be used to establish \"genuine\" modal lower bounds for size of dag-like modal resolution proofs. We illustrate the technique by devising a new modal pigeonhole principle, which we demonstrate to require exponential-size proofs in modal resolution. Finally, we compare modal resolution to the modal Frege systems of Hrubeš (Ann Pure Appl Log 157(2-3):194-205, 2009) and obtain a \"genuinely\" modal separation.</p>","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"66 1","pages":"1-41"},"PeriodicalIF":1.1,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8752563/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"39713036","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Integrating Owicki–Gries for C11-Style Memory Models into Isabelle/HOL 基于Owicki-Gries的c11风格记忆模型与Isabelle/HOL的集成
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2021-11-16 DOI: 10.1007/s10817-021-09610-2
Sadegh Dalvandi, Brijesh Dongol, Simon Doherty, H. Wehrheim
{"title":"Integrating Owicki–Gries for C11-Style Memory Models into Isabelle/HOL","authors":"Sadegh Dalvandi, Brijesh Dongol, Simon Doherty, H. Wehrheim","doi":"10.1007/s10817-021-09610-2","DOIUrl":"https://doi.org/10.1007/s10817-021-09610-2","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"66 1","pages":"141 - 171"},"PeriodicalIF":1.1,"publicationDate":"2021-11-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46190767","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Efficient Extensional Binary Tries 有效的扩展二进制尝试
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2021-10-11 DOI: 10.1007/s10817-022-09655-x
A. Appel, X. Leroy
{"title":"Efficient Extensional Binary Tries","authors":"A. Appel, X. Leroy","doi":"10.1007/s10817-022-09655-x","DOIUrl":"https://doi.org/10.1007/s10817-022-09655-x","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"67 1","pages":"1-27"},"PeriodicalIF":1.1,"publicationDate":"2021-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47222827","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Conflict-Driven Satisfiability for Theory Combination: Lemmas, Modules, and Proofs 理论组合的冲突驱动的可满足性:引理、模块和证明
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2021-09-12 DOI: 10.1007/s10817-021-09606-y
M. P. Bonacina, Stéphane Graham-Lengrand, N. Shankar
{"title":"Conflict-Driven Satisfiability for Theory Combination: Lemmas, Modules, and Proofs","authors":"M. P. Bonacina, Stéphane Graham-Lengrand, N. Shankar","doi":"10.1007/s10817-021-09606-y","DOIUrl":"https://doi.org/10.1007/s10817-021-09606-y","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"66 1","pages":"43 - 91"},"PeriodicalIF":1.1,"publicationDate":"2021-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42181460","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 6
Handling Transitive Relations in First-Order Automated Reasoning 一阶自动推理中传递关系的处理
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2021-09-09 DOI: 10.1007/s10817-021-09605-z
Koen Claessen, A. Lillieström
{"title":"Handling Transitive Relations in First-Order Automated Reasoning","authors":"Koen Claessen, A. Lillieström","doi":"10.1007/s10817-021-09605-z","DOIUrl":"https://doi.org/10.1007/s10817-021-09605-z","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"65 1","pages":"1097 - 1124"},"PeriodicalIF":1.1,"publicationDate":"2021-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46001372","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Author Index to Volume 31 第31卷作者索引
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2021-09-01 DOI: 10.1023/B:JARS.0000021187.23857.1b
{"title":"Author Index to Volume 31","authors":"","doi":"10.1023/B:JARS.0000021187.23857.1b","DOIUrl":"https://doi.org/10.1023/B:JARS.0000021187.23857.1b","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"31 1","pages":"371"},"PeriodicalIF":1.1,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1023/B:JARS.0000021187.23857.1b","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49634650","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Distilling the Requirements of Gödel’s Incompleteness Theorems with a Proof Assistant 用一个证明助手提取Gödel的不完备性定理的要求
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2021-08-28 DOI: 10.1007/s10817-021-09599-8
A. Popescu, Dmitriy Traytel
{"title":"Distilling the Requirements of Gödel’s Incompleteness Theorems with a Proof Assistant","authors":"A. Popescu, Dmitriy Traytel","doi":"10.1007/s10817-021-09599-8","DOIUrl":"https://doi.org/10.1007/s10817-021-09599-8","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"65 1","pages":"1027 - 1070"},"PeriodicalIF":1.1,"publicationDate":"2021-08-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10817-021-09599-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44621322","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Derivational Complexity and Context-Sensitive Rewriting 衍生复杂性和上下文敏感重写
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2021-08-12 DOI: 10.1007/s10817-021-09603-1
Salvador Lucas
{"title":"Derivational Complexity and Context-Sensitive Rewriting","authors":"Salvador Lucas","doi":"10.1007/s10817-021-09603-1","DOIUrl":"https://doi.org/10.1007/s10817-021-09603-1","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"65 1","pages":"1191 - 1229"},"PeriodicalIF":1.1,"publicationDate":"2021-08-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10817-021-09603-1","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45918045","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Towards Formalising Schutz’ Axioms for Minkowski Spacetime in Isabelle/HOL 在Isabelle/HOL中对闵可夫斯基时空的Schutz公理的形式化
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2021-08-08 DOI: 10.1007/s10817-022-09643-1
Richard Schmoetten, Jake E. Palmer, Jacques D. Fleuriot
{"title":"Towards Formalising Schutz’ Axioms for Minkowski Spacetime in Isabelle/HOL","authors":"Richard Schmoetten, Jake E. Palmer, Jacques D. Fleuriot","doi":"10.1007/s10817-022-09643-1","DOIUrl":"https://doi.org/10.1007/s10817-022-09643-1","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"66 1","pages":"953 - 988"},"PeriodicalIF":1.1,"publicationDate":"2021-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41664541","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Human-Centered Automated Proof Search 以人为中心的自动证明搜索
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2021-07-30 DOI: 10.1007/s10817-021-09594-z
W. Sieg, Farzaneh Derakhshan
{"title":"Human-Centered Automated Proof Search","authors":"W. Sieg, Farzaneh Derakhshan","doi":"10.1007/s10817-021-09594-z","DOIUrl":"https://doi.org/10.1007/s10817-021-09594-z","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"65 1","pages":"1153 - 1190"},"PeriodicalIF":1.1,"publicationDate":"2021-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1007/s10817-021-09594-z","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46309316","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页 下一页 尾页
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学术官方微信