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

Journal of Automated Reasoning最新文献

筛选
英文 中文
A Posthumous Contribution by Larry Wos: Excerpts from an Unpublished Column 拉里·沃斯的遗作:摘自一篇未发表的专栏文章
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2022-02-01 DOI: 10.1007/s10817-022-09617-3
Sophie Tourret, Christoph Weidenbach
{"title":"A Posthumous Contribution by Larry Wos: Excerpts from an Unpublished Column","authors":"Sophie Tourret, Christoph Weidenbach","doi":"10.1007/s10817-022-09617-3","DOIUrl":"https://doi.org/10.1007/s10817-022-09617-3","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"66 1","pages":"575 - 584"},"PeriodicalIF":1.1,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46150858","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
Formalization of the Computational Theory of a Turing Complete Functional Language Model 图灵完备函数语言模型的计算理论形式化
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2022-01-30 DOI: 10.1007/s10817-021-09615-x
Thiago Mendonça Ferreira Ramos, Ariane Alves Almeida, M. Ayala-Rincón
{"title":"Formalization of the Computational Theory of a Turing Complete Functional Language Model","authors":"Thiago Mendonça Ferreira Ramos, Ariane Alves Almeida, M. Ayala-Rincón","doi":"10.1007/s10817-021-09615-x","DOIUrl":"https://doi.org/10.1007/s10817-021-09615-x","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"66 1","pages":"1031 - 1063"},"PeriodicalIF":1.1,"publicationDate":"2022-01-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48171306","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
Making Higher-Order Superposition Work 使高阶叠加工作
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2022-01-17 DOI: 10.1007/s10817-021-09613-z
P. Vukmirović, A. Bentkamp, J. Blanchette, Simon Cruanes, V. Nummelin, Sophie Tourret
{"title":"Making Higher-Order Superposition Work","authors":"P. Vukmirović, A. Bentkamp, J. Blanchette, Simon Cruanes, V. Nummelin, Sophie Tourret","doi":"10.1007/s10817-021-09613-z","DOIUrl":"https://doi.org/10.1007/s10817-021-09613-z","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"66 1","pages":"541 - 564"},"PeriodicalIF":1.1,"publicationDate":"2022-01-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41424215","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}
引用次数: 20
A Mechanized Proof of the Max-Flow Min-Cut Theorem for Countable Networks with Applications to Probability Theory 可数网络最大流最小割定理的机械化证明及其在概率论中的应用
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2022-01-15 DOI: 10.1007/s10817-022-09616-4
A. Lochbihler
{"title":"A Mechanized Proof of the Max-Flow Min-Cut Theorem for Countable Networks with Applications to Probability Theory","authors":"A. Lochbihler","doi":"10.1007/s10817-022-09616-4","DOIUrl":"https://doi.org/10.1007/s10817-022-09616-4","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"66 1","pages":"585 - 610"},"PeriodicalIF":1.1,"publicationDate":"2022-01-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43647482","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
A Wos Challenge Met
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2022-01-09 DOI: 10.1007/s10817-021-09614-y
Robert Veroff
{"title":"A Wos Challenge Met","authors":"Robert Veroff","doi":"10.1007/s10817-021-09614-y","DOIUrl":"https://doi.org/10.1007/s10817-021-09614-y","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"1 1","pages":"1-10"},"PeriodicalIF":1.1,"publicationDate":"2022-01-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43478210","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
Automated Reasoning: 11th International Joint Conference, IJCAR 2022, Haifa, Israel, August 8–10, 2022, Proceedings 自动推理:第11届国际联合会议，IJCAR 2022，海法，以色列，2022年8月8-10日，论文集
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2022-01-01 DOI: 10.1007/978-3-031-10769-6
{"title":"Automated Reasoning: 11th International Joint Conference, IJCAR 2022, Haifa, Israel, August 8–10, 2022, Proceedings","authors":"","doi":"10.1007/978-3-031-10769-6","DOIUrl":"https://doi.org/10.1007/978-3-031-10769-6","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"71 1","pages":""},"PeriodicalIF":1.1,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80409023","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 Formalization of the Smith Normal Form in Higher-Order Logic. 高阶逻辑中Smith范式的形式化。
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2022-01-01 Epub Date: 2022-05-26 DOI: 10.1007/s10817-022-09631-5
Jose Divasón, René Thiemann
{"title":"A Formalization of the Smith Normal Form in Higher-Order Logic.","authors":"Jose Divasón,&nbsp;René Thiemann","doi":"10.1007/s10817-022-09631-5","DOIUrl":"https://doi.org/10.1007/s10817-022-09631-5","url":null,"abstract":"<p><p>This work presents formal correctness proofs in Isabelle/HOL of algorithms to transform a matrix into Smith normal form, a canonical matrix form, in a general setting: the algorithms are written in an abstract form and parameterized by very few simple operations. We formally show their soundness provided the operations exist and satisfy some conditions, which always hold on Euclidean domains. We also provide a formal proof on some results about the generality of such algorithms as well as the uniqueness of the Smith normal form. Since Isabelle/HOL does not feature dependent types, the development is carried out by switching conveniently between two different existing libraries by means of the lifting and transfer package and the use of local type definitions, a sound extension to HOL.</p>","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"66 4","pages":"1065-1095"},"PeriodicalIF":1.1,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9637085/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40675395","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}
引用次数: 1
A Formalization of SQL with Nulls. 带空的SQL的形式化。
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2022-01-01 Epub Date: 2022-07-27 DOI: 10.1007/s10817-022-09632-4
Wilmer Ricciotti, James Cheney
{"title":"A Formalization of SQL with Nulls.","authors":"Wilmer Ricciotti,&nbsp;James Cheney","doi":"10.1007/s10817-022-09632-4","DOIUrl":"https://doi.org/10.1007/s10817-022-09632-4","url":null,"abstract":"<p><p>SQL is the world's most popular declarative language, forming the basis of the multi-billion-dollar database industry. Although SQL has been standardized, the full standard is based on ambiguous natural language rather than formal specification. Commercial SQL implementations interpret the standard in different ways, so that, given the same input data, the same query can yield different results depending on the SQL system it is run on. Even for a particular system, mechanically checked formalization of all widely-used features of SQL remains an open problem. The lack of a well-understood formal semantics makes it very difficult to validate the soundness of database implementations. Although formal semantics for fragments of SQL were designed in the past, they usually did not support set and bag operations, lateral joins, nested subqueries, and, crucially, null values. Null values complicate SQL's semantics in profound ways analogous to null pointers or side-effects in other programming languages. Since certain SQL queries are equivalent in the absence of null values, but produce different results when applied to tables containing incomplete data, semantics which ignore null values are able to prove query equivalences that are unsound in realistic databases. A formal semantics of SQL supporting all the aforementioned features was only proposed recently. In this paper, we report about our mechanization of SQL semantics covering set/bag operations, lateral joins, nested subqueries, and nulls, written in the Coq proof assistant, and describe the validation of key metatheoretic properties. Additionally, we are able to use the same framework to formalize the semantics of a flat relational calculus (with null values), and show a certified translation of its normal forms into SQL.</p>","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"66 4","pages":"989-1030"},"PeriodicalIF":1.1,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9637088/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40675398","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}
引用次数: 2
A Comprehensive Framework for Saturation Theorem Proving. 饱和定理证明的综合框架
IF 0.9 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2022-01-01 Epub Date: 2022-06-07 DOI: 10.1007/s10817-022-09621-7
Uwe Waldmann, Sophie Tourret, Simon Robillard, Jasmin Blanchette
{"title":"A Comprehensive Framework for Saturation Theorem Proving.","authors":"Uwe Waldmann, Sophie Tourret, Simon Robillard, Jasmin Blanchette","doi":"10.1007/s10817-022-09621-7","DOIUrl":"10.1007/s10817-022-09621-7","url":null,"abstract":"<p><p>A crucial operation of saturation theorem provers is deletion of subsumed formulas. Designers of proof calculi, however, usually discuss this only informally, and the rare formal expositions tend to be clumsy. This is because the equivalence of dynamic and static refutational completeness holds only for derivations where all deleted formulas are redundant, but the standard notion of redundancy is too weak: A clause <i>C</i> does not make an instance <math><mrow><mi>C</mi> <mi>σ</mi></mrow> </math> redundant. We present a framework for formal refutational completeness proofs of abstract provers that implement saturation calculi, such as ordered resolution and superposition. The framework modularly extends redundancy criteria derived via a familiar ground-to-nonground lifting. It allows us to extend redundancy criteria so that they cover subsumption, and also to model entire prover architectures so that the static refutational completeness of a calculus immediately implies the dynamic refutational completeness of a prover implementing the calculus within, for instance, an Otter or DISCOUNT loop. Our framework is mechanized in Isabelle/HOL.</p>","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"66 4","pages":"499-539"},"PeriodicalIF":0.9,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC9637109/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"40675397","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
Faster Linear Unification Algorithm 更快的线性统一算法
IF 1.1 3区 计算机科学
Journal of Automated Reasoning Pub Date : 2022-01-01 DOI: 10.1007/s10817-022-09635-1
D. Champeaux
{"title":"Faster Linear Unification Algorithm","authors":"D. Champeaux","doi":"10.1007/s10817-022-09635-1","DOIUrl":"https://doi.org/10.1007/s10817-022-09635-1","url":null,"abstract":"","PeriodicalId":15082,"journal":{"name":"Journal of Automated Reasoning","volume":"66 1","pages":"845-860"},"PeriodicalIF":1.1,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"52342458","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学术官方微信