Nothing Special   »   [go: up one dir, main page]

skip to main content
10.1007/978-3-030-53518-6_21guideproceedingsArticle/Chapter ViewAbstractPublication PagesConference Proceedingsacm-pubtype
Article

Simple Dataset for Proof Method Recommendation in Isabelle/HOL

Published: 26 July 2020 Publication History

Abstract

Recently, a growing number of researchers have applied machine learning to assist users of interactive theorem provers. However, the expressive nature of underlying logics and esoteric structures of proof documents impede machine learning practitioners, who often do not have much expertise in formal logic, let alone Isabelle/HOL, from achieving a large scale success in this field. In this data description, we present a simple dataset that contains data on over 400k proof method applications along with over 100 extracted features for each in a format that can be processed easily without any knowledge about formal logic. Our simple data format allows machine learning practitioners to try machine learning tools to predict proof methods in Isabelle/HOL without requiring domain expertise in logic.

References

[1]
Bansal, K., Loos, S.M., Rabe, M.N., Szegedy, C., Wilcox, S.: HOList: an environment for machine learning of higher order logic theorem proving. In: Proceedings of the 36th International Conference on Machine Learning, ICML 2019, Long Beach, California, USA (2019). http://proceedings.mlr.press/v97/bansal19a.html
[2]
Blanchette JC, Haslbeck MW, Matichuk D, and Nipkow T Kerber M, Carette J, Kaliszyk C, Rabe F, and Sorge V Mining the archive of formal proofs Intelligent Computer Mathematics 2015 Heidelberg Springer 3-17
[3]
Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification and Regression Trees. Wadsworth (1984)
[4]
Gauthier, T., Kaliszyk, C., Urban, J.: TacticToe: learning to reason with HOL4 tactics. In: LPAR-21, 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning, Maun, Botswana (2017). http://www.easychair.org/publications/paper/340355
[5]
Gransden T, Walkinshaw N, and Raman R Felty A and Middeldorp A SEPIA: search for proofs using inferred automata Automated Deduction - CADE-25 2015 Cham Springer 246-255
[6]
Hales, T.C., et al.: a formal proof of the Kepler conjecture. CoRR abs/1501.02155 (2015). http://arxiv.org/abs/1501.02155
[7]
Harrison J Srivas M and Camilleri A HOL light: a tutorial introduction Formal Methods in Computer-Aided Design 1996 Heidelberg Springer 265-289
[8]
Harrison J The HOL light theory of euclidean space J. Autom. Reason. 2013 50 2 173-190
[9]
Kaliszyk, C., Chollet, F., Szegedy, C.: HolStep: A machine learning dataset for higher-order logic theorem proving. In: 5th International Conference on Learning Representations, ICLR 2017, Toulon, France, Conference Track Proceedings (2017)
[10]
Klein, G., Nipkow, T., Paulson, L., Thiemann, R.: The archive of formal proofs (2004). https://www.isa-afp.org/
[11]
Komendantskaya E and Heras J Geuvers H, England M, Hasan O, Rabe F, and Teschke O Proof mining with dependent types Intelligent Computer Mathematics 2017 Cham Springer 303-318
[12]
Matichuk, D., Murray, T.C., Andronick, J., Jeffery, D.R., Klein, G., Staples, M.: Empirical study towards a leading indicator for cost of formal software verification. In: 37th IEEE/ACM International Conference on Software Engineering, ICSE 2015, Florence, Italy, vol. 1 (2015). https://doi.org/10.1109/ICSE.2015.85
[13]
Nagashima Y Lin A LiFtEr: language to encode induction heuristics for Isabelle/HOL Programming Languages and Systems 2019 Cham Springer 266-287
[14]
Nagashima, Y.: Appendix to “simple dataset for proof method recommendation in Isabelle/HOL (dataset description)”, May 2020. https://doi.org/10.5281/zenodo.3839417
[15]
Nagashima, Y.: Simple dataset for proof method recommendation in Isabelle/HOL, May 2020. https://doi.org/10.5281/zenodo.3819026
[16]
Nagashima, Y.: Smart induction for Isabelle/HOL (tool paper). CoRR abs/2001.10834 (2020). https://arxiv.org/abs/2001.10834
[17]
Nagashima, Y., He, Y.: PaMpeR: proof method recommendation system for Isabelle/HOL. In: Proceedings of the 33rd ACM/IEEE International Conference on Automated Software Engineering, ASE 2018, Montpellier, France, 3–7 September 2018, pp. 362–372 (2018). https://doi.org/10.1145/3238147.3238210
[18]
Nagashima Y and Kumar R de Moura L A proof strategy language and proof script generation for Isabelle/HOL Automated Deduction - CADE 26 2017 Cham Springer 528-545
[19]
Nagashima Y and Parsert J Rabe F, Farmer W, Passmore G, and Youssef A Goal-oriented conjecturing for Isabelle/HOL Intelligent Computer Mathematics 2018 Cham Springer 225-231
[20]
Nipkow T, Paulson LC, and Wenzel M Isabelle/HOL - A Proof Assistant for Higher-Order Logic 2002 Heidelberg Springer

Cited By

View all

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Guide Proceedings
Intelligent Computer Mathematics: 13th International Conference, CICM 2020, Bertinoro, Italy, July 26–31, 2020, Proceedings
Jul 2020
342 pages
ISBN:978-3-030-53517-9
DOI:10.1007/978-3-030-53518-6
  • Editors:
  • Christoph Benzmüller,
  • Bruce Miller

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 26 July 2020

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 30 Dec 2024

Other Metrics

Citations

Cited By

View all

View Options

View options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media