从TSTP文件重建Dedukti证明的工具(扩展摘要)

M. Haddad, Guillaume Burel, F. Blanqui
{"title":"从TSTP文件重建Dedukti证明的工具(扩展摘要)","authors":"M. Haddad, Guillaume Burel, F. Blanqui","doi":"10.4204/EPTCS.301.5","DOIUrl":null,"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.0000,"publicationDate":"2019-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"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\":null,\"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.0000,\"publicationDate\":\"2019-08-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Workshop on Proof Exchange for Theorem Proving\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4204/EPTCS.301.5\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Workshop on Proof Exchange for Theorem Proving","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.301.5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

证明助手经常调用自动定理证明器来证明子目标。然而,每个证明者都有自己的证明演算,它产生的证明轨迹往往缺乏许多细节来构建一个完整的证明。因此,这些痕迹很难在证明助手中检查和重用。Dedukti是一个证明检查器,他的证明可以翻译成各种证明助手:Coq, HOL, Lean, matta, PVS。我们实现了一个工具,可以从TSTP文件中提取TPTP子问题,并使用能够生成Dedukti证明的自动证明器(如ZenonModulo或ArchSAT)在Dedukti中重建完整的证明。这个工具是通用的:它对生成跟踪的证明者的证明演算没有任何假设,并且它可以使用不同的证明者来生成Dedukti证明。我们将我们的工具应用于由自动定理证明器对TPTP库的CNF问题产生的轨迹上,我们能够重建其中很大一部分的证明,显著增加了这些问题可以获得的Dedukti证明的数量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
EKSTRAKTO A tool to reconstruct Dedukti proofs from TSTP files (extended 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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信