Statistical Proof Pattern Recognition: Automated or Interactive?
J\'onathan Heras, Ekaterina Komendantskaya

TL;DR
This paper compares various approaches used in data mining of large proof libraries within automated and interactive theorem proving to evaluate their effectiveness.
Contribution
It provides a comparative analysis of existing methods for proof pattern recognition in theorem proving environments.
Findings
Identifies strengths and weaknesses of different approaches
Highlights the most effective techniques for proof pattern recognition
Suggests directions for future research in automated theorem proving
Abstract
In this paper, we compare different existing approaches employed in data mining of big proof libraries in automated and interactive theorem proving.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsHandwritten Text Recognition Techniques · Image Processing and 3D Reconstruction · Machine Learning and Data Classification
