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

Journal of Automated Reasoning最新文献

筛选
英文 中文
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
Special Issue of Selected Extended Papers of IJCAR 2020 IJCAR 2020扩展论文选刊
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2022-05-09 DOI: 10.1007/s10817-022-09622-6
N. Peltier, Viorica Sofronie-Stokkermans
{"title":"Special Issue of Selected Extended Papers of IJCAR 2020","authors":"N. Peltier, Viorica Sofronie-Stokkermans","doi":"10.1007/s10817-022-09622-6","DOIUrl":"https://doi.org/10.1007/s10817-022-09622-6","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"66 1","pages":"275 - 276"},"PeriodicalIF":1.1,"publicationDate":"2022-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43761681","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
Deciding the Word Problem for Ground and Strongly Shallow Identities w.r.t. Extensional Symbols 关于扩展符号的基本恒等式和强浅恒等式的判定问题
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2022-05-07 DOI: 10.1007/s10817-022-09624-4
F. Baader, D. Kapur
{"title":"Deciding the Word Problem for Ground and Strongly Shallow Identities w.r.t. Extensional Symbols","authors":"F. Baader, D. Kapur","doi":"10.1007/s10817-022-09624-4","DOIUrl":"https://doi.org/10.1007/s10817-022-09624-4","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"66 1","pages":"301 - 329"},"PeriodicalIF":1.1,"publicationDate":"2022-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49108355","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
Mechanising Gödel–Löb Provability Logic in HOL Light hollight中的可证明性逻辑机械化Gödel-Löb
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2022-05-07 DOI: 10.1007/s10817-023-09677-z
M. Maggesi, C. Brogi
{"title":"Mechanising Gödel–Löb Provability Logic in HOL Light","authors":"M. Maggesi, C. Brogi","doi":"10.1007/s10817-023-09677-z","DOIUrl":"https://doi.org/10.1007/s10817-023-09677-z","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":" ","pages":""},"PeriodicalIF":1.1,"publicationDate":"2022-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42342275","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
Fast Left Kan Extensions Using the Chase 使用Chase的快速左Kan扩展
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2022-05-05 DOI: 10.1007/s10817-022-09634-2
Joshua Meyers, David I. Spivak, Ryan Wisnesky
{"title":"Fast Left Kan Extensions Using the Chase","authors":"Joshua Meyers, David I. Spivak, Ryan Wisnesky","doi":"10.1007/s10817-022-09634-2","DOIUrl":"https://doi.org/10.1007/s10817-022-09634-2","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"66 1","pages":"805 - 844"},"PeriodicalIF":1.1,"publicationDate":"2022-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43411513","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}
引用次数: 4
Polite Combination of Algebraic Datatypes 代数数据类型的合理组合
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2022-05-05 DOI: 10.1007/s10817-022-09625-3
Ying Sheng, Yoni Zohar, C. Ringeissen, Jane Lange, P. Fontaine, Clark W. Barrett
{"title":"Polite Combination of Algebraic Datatypes","authors":"Ying Sheng, Yoni Zohar, C. Ringeissen, Jane Lange, P. Fontaine, Clark W. Barrett","doi":"10.1007/s10817-022-09625-3","DOIUrl":"https://doi.org/10.1007/s10817-022-09625-3","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"66 1","pages":"331 - 355"},"PeriodicalIF":1.1,"publicationDate":"2022-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47842659","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
Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains 用模型理论寻找具有具体域的可判定可牵引描述逻辑
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2022-05-04 DOI: 10.1007/s10817-022-09626-2
F. Baader, Jakub Rydval
{"title":"Using Model Theory to Find Decidable and Tractable Description Logics with Concrete Domains","authors":"F. Baader, Jakub Rydval","doi":"10.1007/s10817-022-09626-2","DOIUrl":"https://doi.org/10.1007/s10817-022-09626-2","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"66 1","pages":"357 - 407"},"PeriodicalIF":1.1,"publicationDate":"2022-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48320494","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}
引用次数: 5
Binary Codes that do not Preserve Primitivity 不保留原语的二进制代码
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2022-03-21 DOI: 10.1007/s10817-023-09674-2
S. Holub, Martin Raška, Štěpán Starosta
{"title":"Binary Codes that do not Preserve Primitivity","authors":"S. Holub, Martin Raška, Štěpán Starosta","doi":"10.1007/s10817-023-09674-2","DOIUrl":"https://doi.org/10.1007/s10817-023-09674-2","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":" ","pages":""},"PeriodicalIF":1.1,"publicationDate":"2022-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44194696","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
Verifying Whiley Programs with Boogie 用Boogie验证Whiley程序
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2022-03-20 DOI: 10.1007/s10817-022-09619-1
David J. Pearce, M. Utting, L. Groves
{"title":"Verifying Whiley Programs with Boogie","authors":"David J. Pearce, M. Utting, L. Groves","doi":"10.1007/s10817-022-09619-1","DOIUrl":"https://doi.org/10.1007/s10817-022-09619-1","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"66 1","pages":"747 - 803"},"PeriodicalIF":1.1,"publicationDate":"2022-03-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45249962","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
首页 上一页 下一页 尾页
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学术官方微信
小红书