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

International Workshop on Proof Exchange for Theorem Proving最新文献

筛选
英文 中文
Alethe: Towards a Generic SMT Proof Format (extended abstract) Alethe:走向通用的SMT证明格式(扩展摘要)
International Workshop on Proof Exchange for Theorem Proving Pub Date : 2021-07-06 DOI: 10.4204/EPTCS.336.6
Hans-Jörg Schurr, M. Fleury, Haniel Barbosa, P. Fontaine
{"title":"Alethe: Towards a Generic SMT Proof Format (extended abstract)","authors":"Hans-Jörg Schurr, M. Fleury, Haniel Barbosa, P. Fontaine","doi":"10.4204/EPTCS.336.6","DOIUrl":"https://doi.org/10.4204/EPTCS.336.6","url":null,"abstract":"The first iteration of the proof format used by the SMT solver veriT was presented ten years ago at the first PxTP workshop. Since then the format has matured. veriT proofs are used within multiple applications, and other solvers generate proofs in the same format. We would now like to gather feedback from the community to guide future developments. Towards this, we review the history of the format, present our pragmatic approach to develop the format, and also discuss problems that might arise when other solvers use the format.","PeriodicalId":422279,"journal":{"name":"International Workshop on Proof Exchange for Theorem Proving","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124410730","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
A Framework for Proof-carrying Logical Transformations 带证明逻辑变换的框架
International Workshop on Proof Exchange for Theorem Proving Pub Date : 2021-07-06 DOI: 10.4204/EPTCS.336.2
Quentin Garchery
{"title":"A Framework for Proof-carrying Logical Transformations","authors":"Quentin Garchery","doi":"10.4204/EPTCS.336.2","DOIUrl":"https://doi.org/10.4204/EPTCS.336.2","url":null,"abstract":"In various provers and deductive verification tools, logical transformations are used extensively in order to reduce a proof task into a number of simpler tasks. Logical transformations are often part of the trusted base of such tools. In this paper, we develop a framework to improve confidence in their results. We follow a modular and skeptical approach: transformations are instrumented independently of each other and produce certificates that are checked by a third-party tool. Logical transformations are considered in a higher-order logic, with type polymorphism and built-in theories such as equality and integer arithmetic. We develop a language of proof certificates for them and use it to implement the full chain of certificate generation and certificate verification.","PeriodicalId":422279,"journal":{"name":"International Workshop on Proof Exchange for Theorem Proving","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125463843","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Proof Generation in CDSAT CDSAT的证明生成
International Workshop on Proof Exchange for Theorem Proving Pub Date : 2021-07-06 DOI: 10.4204/EPTCS.336.1
M. P. Bonacina
{"title":"Proof Generation in CDSAT","authors":"M. P. Bonacina","doi":"10.4204/EPTCS.336.1","DOIUrl":"https://doi.org/10.4204/EPTCS.336.1","url":null,"abstract":"The main ideas in the CDSAT (Conflict-Driven Satisfiability) framework for SMT are summarized, leading to approaches to proof generation in CDSAT.","PeriodicalId":422279,"journal":{"name":"International Workshop on Proof Exchange for Theorem Proving","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115344721","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Integrating an Automated Prover for Projective Geometry as a New Tactic in the Coq Proof Assistant 在Coq证明助手中集成射影几何自动证明的新策略
International Workshop on Proof Exchange for Theorem Proving Pub Date : 2021-07-06 DOI: 10.4204/EPTCS.336.4
Nicolas Magaud
{"title":"Integrating an Automated Prover for Projective Geometry as a New Tactic in the Coq Proof Assistant","authors":"Nicolas Magaud","doi":"10.4204/EPTCS.336.4","DOIUrl":"https://doi.org/10.4204/EPTCS.336.4","url":null,"abstract":"Recently, we developed an automated theorem prover for projective incidence geometry. This prover, based on a combinatorial approach using matroids, proceeds by saturation using the matroid rules. It is designed as an independent tool, implemented in C, which takes a geometric configuration as input and produces as output some Coq proof scripts: the statement of the expected theorem, a proof script proving the theorem and possibly some auxiliary lemmas. In this document, we show how to embed such an external tool as a plugin in Coq so that it can be used as a simple tactic.","PeriodicalId":422279,"journal":{"name":"International Workshop on Proof Exchange for Theorem Proving","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133790277","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
General Automation in Coq through Modular Transformations 通过模块转换实现Coq中的通用自动化
International Workshop on Proof Exchange for Theorem Proving Pub Date : 2021-07-06 DOI: 10.4204/EPTCS.336.3
Valentin Blot, Louise Dubois de Prisque, C. Keller, Pierre Vial
{"title":"General Automation in Coq through Modular Transformations","authors":"Valentin Blot, Louise Dubois de Prisque, C. Keller, Pierre Vial","doi":"10.4204/EPTCS.336.3","DOIUrl":"https://doi.org/10.4204/EPTCS.336.3","url":null,"abstract":"Whereas proof assistants based on Higher-Order Logic benefit from external solvers' automation, those based on Type Theory resist automation and thus require more expertise. Indeed, the latter use a more expressive logic which is further away from first-order logic, the logic of most automatic theorem provers. In this article, we develop a methodology to transform a subset of Coq goals into first-order statements that can be automatically discharged by automatic provers. The general idea is to write modular, pairwise independent transformations and combine them. Each of these eliminates a specific aspect of Coq logic towards first-order logic. As a proof of concept, we apply this methodology to a set of simple but crucial transformations which extend the local context with proven first-order assertions that make Coq definitions and algebraic types explicit. They allow users of Coq to solve non-trivial goals automatically. This methodology paves the way towards the definition and combination of more complex transformations, making Coq more accessible.","PeriodicalId":422279,"journal":{"name":"International Workshop on Proof Exchange for Theorem Proving","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126896875","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
CLS-SMT: Bringing Together Combinatory Logic Synthesis and Satisfiability Modulo Theories CLS-SMT：将组合逻辑合成与可满足性模态理论结合起来
International Workshop on Proof Exchange for Theorem Proving Pub Date : 2019-08-23 DOI: 10.4204/EPTCS.301.7
Fadil Kallat, Tristan Schäfer, Anna A. Vasileva
{"title":"CLS-SMT: Bringing Together Combinatory Logic Synthesis and Satisfiability Modulo Theories","authors":"Fadil Kallat, Tristan Schäfer, Anna A. Vasileva","doi":"10.4204/EPTCS.301.7","DOIUrl":"https://doi.org/10.4204/EPTCS.301.7","url":null,"abstract":"We introduce an approach that aims to combine the usage of satisfiability modulo theories (SMT) solvers with the Combinatory Logic Synthesizer (CL)S framework. (CL)S is a tool for the automatic composition of software components from a user-specified repository. The framework yields a tree grammar that contains all composed terms that comply with a target type. Type specifications for (CL)S are based on combinatory logic with intersection types. Our approach translates the tree grammar into SMT functions, which allows the consideration of additional domain-specific constraints. We demonstrate the usefulness of our approach in several experiments.","PeriodicalId":422279,"journal":{"name":"International Workshop on Proof Exchange for Theorem Proving","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130642351","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Converting ALC Connection Proofs into ALC Sequents 转换ALC连接证明到ALC序列
International Workshop on Proof Exchange for Theorem Proving Pub Date : 2019-08-23 DOI: 10.4204/EPTCS.301.3
Eunice Palmeira da Silva, F. Freitas, J. Otten
{"title":"Converting ALC Connection Proofs into ALC Sequents","authors":"Eunice Palmeira da Silva, F. Freitas, J. Otten","doi":"10.4204/EPTCS.301.3","DOIUrl":"https://doi.org/10.4204/EPTCS.301.3","url":null,"abstract":"The connection method has earned good reputation in the area of automated theorem proving, due to its simplicity, efficiency and rational use of memory. This method has been applied recently in automatic provers that reason over ontologies written in the description logic ALC. However, proofs generated by connection calculi are difficult to understand. Proof readability is largely lost by the transformations to disjunctive normal form applied over the formulae to be proven. Such a proof model, albeit efficient, prevents inference systems based on it from effectively providing justifications and/or descriptions of the steps used in inferences. To address this problem, in this paper we propose a method for converting matricial proofs generated by the ALC connection method to ALC sequent proofs, which are much easier to understand, and whose translation to natural language is more straightforward. We also describe a calculus that accepts the input formula in a non-clausal ALC format, what simplifies the translation.","PeriodicalId":422279,"journal":{"name":"International Workshop on Proof Exchange for Theorem Proving","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126440978","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
EKSTRAKTO A tool to reconstruct Dedukti proofs from TSTP files (extended abstract) 从TSTP文件重建Dedukti证明的工具(扩展摘要)
International Workshop on Proof Exchange for Theorem Proving Pub Date : 2019-08-23 DOI: 10.4204/EPTCS.301.5
M. Haddad, Guillaume Burel, F. Blanqui
{"title":"EKSTRAKTO A tool to reconstruct Dedukti proofs from TSTP files (extended abstract)","authors":"M. Haddad, Guillaume Burel, F. Blanqui","doi":"10.4204/EPTCS.301.5","DOIUrl":"https://doi.org/10.4204/EPTCS.301.5","url":null,"abstract":"Proof assistants often call automated theorem provers to prove subgoals. However, each prover has its own proof calculus and the proof traces that it produces often lack many details to build a complete proof. Hence these traces are hard to check and reuse in proof assistants. Dedukti is a proof checker whose proofs can be translated to various proof assistants: Coq, HOL, Lean, Matita, PVS. We implemented a tool that extracts TPTP subproblems from a TSTP file and reconstructs complete proofs in Dedukti using automated provers able to generate Dedukti proofs like ZenonModulo or ArchSAT. This tool is generic: it assumes nothing about the proof calculus of the prover producing the trace, and it can use different provers to produce the Dedukti proof. We applied our tool on traces produced by automated theorem provers on the CNF problems of the TPTP library and we were able to reconstruct a proof for a large proportion of them, significantly increasing the number of Dedukti proofs that could be obtained for those problems.","PeriodicalId":422279,"journal":{"name":"International Workshop on Proof Exchange for Theorem Proving","volume":"61 4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133000189","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Determinism in the Certification of UNSAT Proofs UNSAT证明认证中的决定论
International Workshop on Proof Exchange for Theorem Proving Pub Date : 2017-12-05 DOI: 10.4204/EPTCS.262.6
Tomer Libal, Xaviera Steele
{"title":"Determinism in the Certification of UNSAT Proofs","authors":"Tomer Libal, Xaviera Steele","doi":"10.4204/EPTCS.262.6","DOIUrl":"https://doi.org/10.4204/EPTCS.262.6","url":null,"abstract":"The search for increased trustworthiness of SAT solvers is very active and uses various methods. Some of these methods obtain a proof from the provers then check it, normally by replicating the search based on the proof's information. Because the certification process involves another nontrivial proof search, the trust we can place in it is decreased. Some attempts to amend this use certifiers which have been verified by proofs assistants such as Isabelle/HOL and Coq. Our approach is different because it is based on an extremely simplified certifier. This certifier enjoys a very high level of trust but is very inefficient. In this paper, we experiment with this approach and conclude that by placing some restrictions on the formats, one can mostly eliminate the need for search and in principle, can certify proofs of arbitrary size.","PeriodicalId":422279,"journal":{"name":"International Workshop on Proof Exchange for Theorem Proving","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116288314","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Alignment-based Translations Across Formal Systems Using Interface Theories 使用接口理论的跨形式系统的基于对齐的翻译
International Workshop on Proof Exchange for Theorem Proving Pub Date : 2017-12-05 DOI: 10.4204/EPTCS.262.7
Dennis Müller, Colin Rothgang, Yufei Liu, Florian Rabe
{"title":"Alignment-based Translations Across Formal Systems Using Interface Theories","authors":"Dennis Müller, Colin Rothgang, Yufei Liu, Florian Rabe","doi":"10.4204/EPTCS.262.7","DOIUrl":"https://doi.org/10.4204/EPTCS.262.7","url":null,"abstract":"Translating expressions between different logics and theorem provers is notoriously and often prohibitively difficult, due to the large differences between the logical foundations, the implementations of the systems, and the structure of the respective libraries. Practical solutions for exchanging theorems across theorem provers have remained both weak and brittle. Consequently, libraries are not easily reusable across systems, and substantial effort must be spent on reformalizing and proving basic results in each system. Notably, this problem exists already if we only try to exchange theorem statements and forgo exchanging proofs. \u0000In previous work we introduced alignments as a lightweight standard for relating concepts across libraries and conjectured that it would provide a good base for translating expressions. In this paper, we demonstrate the feasibility of this approach. We use a foundationally uncommitted framework to write interface theories that abstract from logical foundation, implementation, and library structure. Then we use alignments to record how the concepts in the interface theories are realized in several major proof assistant libraries, and we use that information to translate expressions across libraries. Concretely, we present exemplary interface theories for several areas of mathematics and - in total - several hundred alignments that were found manually.","PeriodicalId":422279,"journal":{"name":"International Workshop on Proof Exchange for Theorem Proving","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-12-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133233978","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"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学术文献互助群
群 号：481959085
Book学术官方微信