Certified Connection Tableaux Proofs for HOL Light and TPTP-Reference-Cited by-同舟云学术

Certified Connection Tableaux Proofs for HOL Light and TPTP

Published:2015-01-13 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2015 Conference on Certified Programs and Proofs
language:
Short-container-title:

Author:

Kaliszyk Cezary¹,Urban Josef²,Vyskočil Jiři³

Affiliation:

1. University of Innsbruck, Innsbruck, Austria

2. Radboud University Nijmegen, Nijmegen, Netherlands

3. Czech Technical University in Prague, Prague, Czech Rep

Funder

Austrian Science Fund

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/2676724.2693176

Reference41 articles.

1. Premise Selection for Mathematics by Corpus Analysis and Kernel Methods

2. leanTAP: Lean tableau-based deduction

3. S. Böhme and T. Nipkow . Sledgehammer: Judgement Day . In J. Giesl and R. Hähnle editors IJCAR volume 6173 of LNCS pages 107 -- 121 . Springer 2010 . ISBN 978-3-642-14202-4. 10.1007/978-3-642-14203-1_9 S. Böhme and T. Nipkow. Sledgehammer: Judgement Day. In J. Giesl and R. Hähnle editors IJCAR volume 6173 of LNCS pages 107--121. Springer 2010. ISBN 978-3-642-14202-4. 10.1007/978-3-642-14203-1_9

4. Premise Selection and External Provers for HOL4

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. gym-saturation: Gymnasium Environments for Saturation Provers (System description);Lecture Notes in Computer Science;2023

2. Learning to Guide a Saturation-Based Theorem Prover;IEEE Transactions on Pattern Analysis and Machine Intelligence;2023-01-01

3. Safe, fast, concurrent proof checking for the lambda-pi calculus modulo rewriting;Proceedings of the 11th ACM SIGPLAN International Conference on Certified Programs and Proofs;2022-01-11

4. Eliminating Models During Model Elimination;Lecture Notes in Computer Science;2021

5. Towards Finding Longer Proofs;Lecture Notes in Computer Science;2021