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

Journal of Automated Reasoning最新文献

筛选
英文 中文
Engel’s Theorem in Mathlib 数学中的恩格尔定理
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2023-04-20 DOI: 10.1007/s10817-023-09668-0
Oliver Nash
{"title":"Engel’s Theorem in Mathlib","authors":"Oliver Nash","doi":"10.1007/s10817-023-09668-0","DOIUrl":"https://doi.org/10.1007/s10817-023-09668-0","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":" ","pages":""},"PeriodicalIF":1.1,"publicationDate":"2023-04-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45475333","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
Synthetic Undecidability and Incompleteness of First-Order Axiom Systems in Coq Coq中一阶公理系统的综合不确定性和不完备性
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2023-03-01 DOI: 10.1007/s10817-022-09647-x
Dominik Kirst, Marc Hermes
{"title":"Synthetic Undecidability and Incompleteness of First-Order Axiom Systems in Coq","authors":"Dominik Kirst, Marc Hermes","doi":"10.1007/s10817-022-09647-x","DOIUrl":"https://doi.org/10.1007/s10817-022-09647-x","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"67 1","pages":"1-31"},"PeriodicalIF":1.1,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41729951","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
Computer-Aided Constructions of Commafree Codes 自由代码的计算机辅助构造
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2023-02-17 DOI: 10.1007/s10817-023-09662-6
Aaron Windsor
{"title":"Computer-Aided Constructions of Commafree Codes","authors":"Aaron Windsor","doi":"10.1007/s10817-023-09662-6","DOIUrl":"https://doi.org/10.1007/s10817-023-09662-6","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"67 1","pages":"1-10"},"PeriodicalIF":1.1,"publicationDate":"2023-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46078852","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
Superposition for Higher-Order Logic 高阶逻辑的叠加
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2023-01-21 DOI: 10.1007/s10817-022-09649-9
A. Bentkamp, J. Blanchette, Sophie Tourret, P. Vukmirović
{"title":"Superposition for Higher-Order Logic","authors":"A. Bentkamp, J. Blanchette, Sophie Tourret, P. Vukmirović","doi":"10.1007/s10817-022-09649-9","DOIUrl":"https://doi.org/10.1007/s10817-022-09649-9","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"67 1","pages":"1-54"},"PeriodicalIF":1.1,"publicationDate":"2023-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46720640","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
Correction: Towards Formalising Schutz’ Axioms for Minkowski Spacetime in Isabelle/HOL 修正:在Isabelle/HOL中对闵可夫斯基时空的舒茨公理的形式化
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2023-01-13 DOI: 10.1007/s10817-022-09651-1
Richard Schmoetten, Jake E. Palmer, Jacques D. Fleuriot
{"title":"Correction: Towards Formalising Schutz’ Axioms for Minkowski Spacetime in Isabelle/HOL","authors":"Richard Schmoetten, Jake E. Palmer, Jacques D. Fleuriot","doi":"10.1007/s10817-022-09651-1","DOIUrl":"https://doi.org/10.1007/s10817-022-09651-1","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"67 1","pages":"1"},"PeriodicalIF":1.1,"publicationDate":"2023-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48124365","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
Optimal Deterministic Controller Synthesis from Steady-State Distributions 基于稳态分布的最优确定性控制器综合
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2023-01-12 DOI: 10.1007/s10817-022-09657-9
Alvaro Velasquez, Ismail R. Alkhouri, K. Subramani, P. Wojciechowski, George K. Atia
{"title":"Optimal Deterministic Controller Synthesis from Steady-State Distributions","authors":"Alvaro Velasquez, Ismail R. Alkhouri, K. Subramani, P. Wojciechowski, George K. Atia","doi":"10.1007/s10817-022-09657-9","DOIUrl":"https://doi.org/10.1007/s10817-022-09657-9","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"67 1","pages":"1-26"},"PeriodicalIF":1.1,"publicationDate":"2023-01-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43222449","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
Semantically-Guided Goal-Sensitive Reasoning: Decision Procedures and the Koala Prover 语义引导的目标敏感推理：决策过程和考拉谚语
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2023-01-11 DOI: 10.1007/s10817-022-09656-w
M. P. Bonacina, S. Winkler
{"title":"Semantically-Guided Goal-Sensitive Reasoning: Decision Procedures and the Koala Prover","authors":"M. P. Bonacina, S. Winkler","doi":"10.1007/s10817-022-09656-w","DOIUrl":"https://doi.org/10.1007/s10817-022-09656-w","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"67 1","pages":"1-42"},"PeriodicalIF":1.1,"publicationDate":"2023-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47793139","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
Measuring the Readability of Geometric Proofs: The Area Method Case 测量几何校对的可读性：面积法案例
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2023-01-10 DOI: 10.1007/s10817-022-09652-0
P. Quaresma, Pierluigi Graziani
{"title":"Measuring the Readability of Geometric Proofs: The Area Method Case","authors":"P. Quaresma, Pierluigi Graziani","doi":"10.1007/s10817-022-09652-0","DOIUrl":"https://doi.org/10.1007/s10817-022-09652-0","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"67 1","pages":"1-21"},"PeriodicalIF":1.1,"publicationDate":"2023-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45483701","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
A Solver for Arrays with Concatenation 具有串联的数组求解器
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2023-01-07 DOI: 10.1007/s10817-022-09654-y
Qinshi Wang, A. Appel
{"title":"A Solver for Arrays with Concatenation","authors":"Qinshi Wang, A. Appel","doi":"10.1007/s10817-022-09654-y","DOIUrl":"https://doi.org/10.1007/s10817-022-09654-y","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":" ","pages":"1-31"},"PeriodicalIF":1.1,"publicationDate":"2023-01-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43588948","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
Combining Higher-Order Logic with Set Theory Formalizations. 将高阶逻辑与集合论形式化相结合。
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2023-01-01 Epub Date: 2023-05-25 DOI: 10.1007/s10817-023-09663-5
Cezary Kaliszyk, Karol Pąk
{"title":"Combining Higher-Order Logic with Set Theory Formalizations.","authors":"Cezary Kaliszyk,&nbsp;Karol Pąk","doi":"10.1007/s10817-023-09663-5","DOIUrl":"10.1007/s10817-023-09663-5","url":null,"abstract":"<p><p>The Isabelle Higher-order Tarski-Grothendieck object logic includes in its foundations both higher-order logic and set theory, which allows importing the libraries of Isabelle/HOL and Isabelle/Mizar. The two libraries, however, define all the basic concepts independently, which means that the results in the two are disconnected. In this paper, we align significant parts of these two libraries, by defining isomorphisms between their concepts, including the real numbers and algebraic structures. The isomorphisms allow us to transport theorems between the foundations and use the results from the libraries simultaneously.</p>","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"67 2","pages":"20"},"PeriodicalIF":1.1,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10209288/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"9545317","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
首页 上一页 下一页 尾页
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学术官方微信