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

Journal of Automated Reasoning最新文献

筛选
英文 中文
Tuple Interpretations for Termination of Term Rewriting 术语重写终止的Tuple解释
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2022-07-25 DOI: 10.1007/s10817-022-09640-4
A. Yamada
{"title":"Tuple Interpretations for Termination of Term Rewriting","authors":"A. Yamada","doi":"10.1007/s10817-022-09640-4","DOIUrl":"https://doi.org/10.1007/s10817-022-09640-4","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"66 1","pages":"667 - 688"},"PeriodicalIF":1.1,"publicationDate":"2022-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43605838","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
Six Decades of Automated Reasoning: Papers in Memory of Larry Wos 60年的自动推理：纪念拉里·沃斯的论文
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2022-07-18 DOI: 10.1007/s10817-022-09637-z
M. P. Bonacina
{"title":"Six Decades of Automated Reasoning: Papers in Memory of Larry Wos","authors":"M. P. Bonacina","doi":"10.1007/s10817-022-09637-z","DOIUrl":"https://doi.org/10.1007/s10817-022-09637-z","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"66 1","pages":"437 - 438"},"PeriodicalIF":1.1,"publicationDate":"2022-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42989786","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
Formalising Szemerédi’s Regularity Lemma and Roth’s Theorem on Arithmetic Progressions in Isabelle/HOL 关于等差数列的szemersamedi正则引理和Roth定理的形式化
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2022-07-15 DOI: 10.1007/s10817-022-09650-2
C. Edmonds, Angeliki Koutsoukou-Argyraki, Lawrence Charles Paulson
{"title":"Formalising Szemerédi’s Regularity Lemma and Roth’s Theorem on Arithmetic Progressions in Isabelle/HOL","authors":"C. Edmonds, Angeliki Koutsoukou-Argyraki, Lawrence Charles Paulson","doi":"10.1007/s10817-022-09650-2","DOIUrl":"https://doi.org/10.1007/s10817-022-09650-2","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":" ","pages":""},"PeriodicalIF":1.1,"publicationDate":"2022-07-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45676994","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}
引用次数: 3
Set of Support, Demodulation, Paramodulation: A Historical Perspective 从历史的角度看支持集、解调集、辅助调制集
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2022-05-24 DOI: 10.1007/s10817-022-09628-0
M. P. Bonacina
{"title":"Set of Support, Demodulation, Paramodulation: A Historical Perspective","authors":"M. P. Bonacina","doi":"10.1007/s10817-022-09628-0","DOIUrl":"https://doi.org/10.1007/s10817-022-09628-0","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"66 1","pages":"463 - 497"},"PeriodicalIF":1.1,"publicationDate":"2022-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49572187","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
Local is Best: Efficient Reductions to Modal Logic K 局部最优：模态逻辑K的有效约简
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2022-05-23 DOI: 10.1007/s10817-022-09630-6
Fabio Papacchini, C. Nalon, U. Hustadt, Clare Dixon
{"title":"Local is Best: Efficient Reductions to Modal Logic K","authors":"Fabio Papacchini, C. Nalon, U. Hustadt, Clare Dixon","doi":"10.1007/s10817-022-09630-6","DOIUrl":"https://doi.org/10.1007/s10817-022-09630-6","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"66 1","pages":"639 - 666"},"PeriodicalIF":1.1,"publicationDate":"2022-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43863727","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
Correction to: Local is Best: Efficient Reductions to Modal Logic K 修正:局部是最好的:模态逻辑K的有效约简
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2022-05-23 DOI: 10.1007/s10817-022-09633-3
Fabio Papacchini, C. Nalon, U. Hustadt, C. Dixon
{"title":"Correction to: Local is Best: Efficient Reductions to Modal Logic K","authors":"Fabio Papacchini, C. Nalon, U. Hustadt, C. Dixon","doi":"10.1007/s10817-022-09633-3","DOIUrl":"https://doi.org/10.1007/s10817-022-09633-3","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"66 1","pages":"1099"},"PeriodicalIF":1.1,"publicationDate":"2022-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46332508","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
Theorem Proving as Constraint Solving with Coherent Logic 用相干逻辑作为约束求解的定理证明
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2022-05-20 DOI: 10.1007/s10817-022-09629-z
Predrag Janičić, Julien Narboux
{"title":"Theorem Proving as Constraint Solving with Coherent Logic","authors":"Predrag Janičić, Julien Narboux","doi":"10.1007/s10817-022-09629-z","DOIUrl":"https://doi.org/10.1007/s10817-022-09629-z","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"66 1","pages":"689 - 746"},"PeriodicalIF":1.1,"publicationDate":"2022-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46543838","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
Rensets and Renaming-Based Recursion for Syntax with Bindings Extended Version 具有绑定扩展版本的语法的基于重集和重命名的递归
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2022-05-18 DOI: 10.1007/s10817-023-09672-4
A. Popescu
{"title":"Rensets and Renaming-Based Recursion for Syntax with Bindings Extended Version","authors":"A. Popescu","doi":"10.1007/s10817-023-09672-4","DOIUrl":"https://doi.org/10.1007/s10817-023-09672-4","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":" ","pages":""},"PeriodicalIF":1.1,"publicationDate":"2022-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46865836","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
SCL(EQ): SCL for First-Order Logic with Equality SCL(EQ):一阶相等逻辑的SCL
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2022-05-17 DOI: 10.1007/s10817-023-09673-3
Hendrik Leidinger, Christoph Weidenbach
{"title":"SCL(EQ): SCL for First-Order Logic with Equality","authors":"Hendrik Leidinger, Christoph Weidenbach","doi":"10.1007/s10817-023-09673-3","DOIUrl":"https://doi.org/10.1007/s10817-023-09673-3","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"67 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2022-05-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41603476","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}
引用次数: 3
Combination of Uniform Interpolants via Beth Definability 统一插值的贝丝可定义性组合
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2022-05-12 DOI: 10.1007/s10817-022-09627-1
D. Calvanese, S. Ghilardi, Alessandro Gianola, M. Montali, Andrey Rivkin
{"title":"Combination of Uniform Interpolants via Beth Definability","authors":"D. Calvanese, S. Ghilardi, Alessandro Gianola, M. Montali, Andrey Rivkin","doi":"10.1007/s10817-022-09627-1","DOIUrl":"https://doi.org/10.1007/s10817-022-09627-1","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"66 1","pages":"409 - 435"},"PeriodicalIF":1.1,"publicationDate":"2022-05-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41923813","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}
引用次数: 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学术文献互助群
群 号：481959085
Book学术官方微信