Automated Improving of Proof Legibility in the Mizar System
- 836 Downloads
Both easily readable and obscure proof scripts can be found in the bodies of formalisations around formal proof checking environments such as Mizar. The communities that use this system try to encourage writing legible texts by making available various solutions, e.g., by introduction of phrases and constructs that make formal deductions look closer to the informal ones. Still, many authors do not want to invest additional efforts in enhancing readability of their scripts and assume this can be handled automatically for them. Therefore, it is desirable to create a tool that can automatically improve legibility of proofs. It turns out that this goal is non-trivial since improving features of text that enhance legibility is in general NP-complete.
The successful application of SMT technology to solving computationally difficult problems suggests that available SMT solvers can give progress in legibility enhancement. In this paper we present the first experimental results obtained with automated legibility improving tools for the Mizar system that use Z3 solver in the backend.
KeywordsOperations on languages Legibility of proofs Proof assistants SMT solvers
Unable to display preview. Download preview PDF.
- 1.Behaghel, O.: Beziehungen zwischen Umfang und Reihenfolge von Satzgliedern. Indogermanische Forschungen 25, 110–142 (1909)Google Scholar
- 2.Blanchette, J.C.: Redirecting Proofs by Contradiction. In: Third International Workshop on Proof Exchange for Theorem Proving, PxTP 2013. EPiC Series, vol. 14, pp. 11–26. EasyChair (2013)Google Scholar
- 5.Ericsson, K.A.: Analysis of memory performance in terms of memory skill. Advances in the psychology of human intelligence, vol. 4. Lawrence Erlbaum Associates Inc., Hillsdale (1988)Google Scholar
- 6.Fitch, F.B.: Symbolic Logic: an Introduction. The Ronald Press Co. (1952)Google Scholar
- 10.Grabowski, A., Schwarzweller, C.: Improving Representation of Knowledge within the Mizar Library. Studies in Logic, Grammar and Rhetoric 18(31), 35–50 (2009)Google Scholar
- 11.Jaśkowski, S.: On the Rules of Supposition in Formal Logic. Studia Logica (1934), Warszawa Reprinted in Polish Logic, McCall, S., ed. Clarendon Press, Oxford (1967)Google Scholar
- 16.Matuszewski, R.: On Automatic Translation of Texts from Mizar-QC language into English. Studies in Logic, Grammar and Rhetoric 4 (1984)Google Scholar
- 20.Pąk, K.: The Algorithms for Improving and Reorganizing Natural Deduction Proofs. Studies in Logic, Grammar and Rhetoric 22(35), 95–112 (2010)Google Scholar
- 22.Pąk, K.: The Algorithms for Improving Legibility of Natural Deduction Proofs. PhD thesis, University of Warsaw (2013)Google Scholar
- 23.Pąk, K., Trybulec, A.: Laplace Expansion. Formalized Mathematics 15(3), 143–150 (2008)Google Scholar
- 24.Smolka, S.J., Blanchette, J.C.: Robust, Semi-Intelligible Isabelle Proofs from ATP Proofs. In: Third International Workshop on Proof Exchange for Theorem Proving, PxTP 2013. EPiC Series, vol. 14, pp. 117–132. EasyChair (2013)Google Scholar
- 27.Wenzel, M.: The Isabelle/Isar Reference Manual. University of Cambridge (2011)Google Scholar
- 28.Whitehead, A.N., Russell, B.: Principia Mathematica to *56. Cambridge Mathematical Library. Cambridge University Press (1910)Google Scholar
- 29.Zammit, V.: On the Readability of Machine Checkable Formal Proofs. PhD thesis, The University of Kent at Canterbury (March 1999)Google Scholar