Journal of Automated Reasoning

, Volume 50, Issue 2, pp 229–241 | Cite as

ATP and Presentation Service for Mizar Formalizations

Article

Abstract

This paper describes the Automated Reasoning for Mizar (\(\textsf{Miz}\mathbb{AR}\)) service, which integrates several automated reasoning, artificial intelligence, and presentation tools with Mizar and its authoring environment. The service provides ATP assistance to Mizar authors in finding and explaining proofs, and offers generation of Mizar problems as challenges to ATP systems. The service is based on a sound translation from the Mizar language to that of first-order ATP systems, and relies on the recent progress in application of ATP systems in large theories containing tens of thousands of available facts. We present the main features of \(\textsf{Miz}\mathbb{AR}\) services, followed by an account of initial experiments in finding proofs with the ATP assistance. Our initial experience indicates that the tool offers substantial help in exploring the Mizar library and in preparing new Mizar articles.

Keywords

Automated reasoning Mizar Interactive theorem proving Automated reasoning in large theories 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alama, J., Kühlwein, D., Tsivtsivadze, E., Urban, J., Heskes, T.: Premise selection for mathematics by corpus analysis and kernel methods. ArXiv e-prints (2011)Google Scholar
  2. 2.
    Bancerek, G.: The ordinal numbers. J. Formaliz. Reason. 1(1), 91–96 (1990)Google Scholar
  3. 3.
    Dahn, I., Wernhard, C.: First-order proof problems extracted from an article in the MIZAR mathematical library. In: Bonacina, M.P., Furbach, U. (eds.) Int. Workshop on First-Order Theorem Proving (FTP’97), pp. 58–62 (1997)Google Scholar
  4. 4.
    Grabowski, A., Kornilowicz, A., Naumowicz, A.: Mizar in a Nutshell. J. Formaliz. Reason. 3(2), 153–245 (2010)MathSciNetMATHGoogle Scholar
  5. 5.
    Hales, T.: A proof of the kepler conjecture. Ann. Math. 162(3), 1065–1185 (2005)MathSciNetMATHCrossRefGoogle Scholar
  6. 6.
    Hales, T. (ed.): A Special Issue on Formal Proof of Notices of the AMS, vol. 55(11). American Mathematical Society (2008)Google Scholar
  7. 7.
    Harrison, J.: Optimizing proof search in model elimination. In: McRobbie, M., Slaney, J.K. (eds.) Proceedings of the 13th International Conference on Automated Deduction. Lecture Notes in Artificial Intelligence, number 1104, pp. 313–327. Springer (1996)Google Scholar
  8. 8.
    Hoder, K., Voronkov, A.: Sine Qua Non for large theory reasoning. In: Sofronie-Stokkermans, V., Bjœrner, N. (eds.) Proceedings of the 23rd International Conference on Automated Deduction. Lecture Notes in Artificial Intelligence, number 6803, pp. 299–314. Springer (2011)Google Scholar
  9. 9.
    Hurd, J.: First-order proof tactics in higher-order logic theorem provers. In: Archer, M., Di Vito, B., Muñoz, C. (eds.) Design and Application of Strategies/Tactics in Higher Order Logics (STRATA 2003), pp. 56–68. NASA Technical Reports, number NASA/CP-2003-212448 (2003)Google Scholar
  10. 10.
    Klein, G., Elphinstone, K., Heiser, G., Andronick, J., Cock, D., Derrin, P., Elkaduwe, D., Engelhardt, K., Kolanski, R., Norrish, M., Sewell, T., Tuch, H., Winwood, S.: seL4: formal verification of an OS kernel. In: Anderson, T. (ed.) Proceedings of the 22nd ACM Symposium on Operating Systems Principles, pp. 207–220. ACM Press (2009)Google Scholar
  11. 11.
    Meng, J., Paulson, L.C.: Lightweight relevance filtering for machine-generated resolution problems. J. Appl. Log. 7(1), 41–57 (2009)MathSciNetMATHCrossRefGoogle Scholar
  12. 12.
    Mycielski, J.: Sur le coloriage des graphes. Colloq. Math. 3, 161–162 (1955)MathSciNetMATHGoogle Scholar
  13. 13.
    Paulson, L.C., Blanchette, J.C.: Three years of experience with Sledgehammer, a practical link between automated and interactive theorem provers. In: 8th IWIL. Invited talk (2010)Google Scholar
  14. 14.
    Pease, A., Sutcliffe, G.: First order reasoning on a large ontology. In: Urban, J., Sutcliffe, G., Schulz, S. (eds.) Proceedings of the CADE-21 Workshop on Empirically Successful Automated Reasoning in Large Theories. CEUR Workshop Proceedings, number 257, pp. 59–69 (2007)Google Scholar
  15. 15.
    Rudnicki, P., Stewart, L.: Simple graphs as simplicial complexes: the Mycielskian of a graph. Formalized Mathematics 20(2), 169–183 (2012)Google Scholar
  16. 16.
    Sutcliffe, G.: SystemOnTPTP. In: McAllester, D. (ed.) Proceedings of the 17th International Conference on Automated Deduction. Lecture Notes in Artificial Intelligence, number 1831, pp. 406–410. Springer (2000)Google Scholar
  17. 17.
    Urban, J.: XML-izing Mizar: making semantic processing and presentaion of MML easy. In: Kohlhase, M. (ed.) Proceedings of the 4th International Conference on Mathematical Knowledge Management. Lecture Notes in Computer Science, number 3863, pp. 346–360 (2005)Google Scholar
  18. 18.
    Urban, J.: MizarMode—an integrated proof assistance tool for the mizar way of formalizing mathematics. J. Appl. Log. 4(4), 414–427 (2006)MathSciNetMATHCrossRefGoogle Scholar
  19. 19.
    Urban, J.: MPTP 0.2: design, implementation, and initial experiments. J. Autom. Reasoning 37(1–2), 21–43 (2006)MATHGoogle Scholar
  20. 20.
    Urban, J.: Parallelizing Mizar. CoRR. abs/1206.0141 (2012)
  21. 21.
    Urban, J., Alama, J., Rudnicki, P., Geuvers, H.: A Wiki for Mizar: motivation, considerations, and initial prototype. In: AISC/MKM/Calculemus. LNCS, vol. 6167, pp. 455–469 (2010)Google Scholar
  22. 22.
    Urban, J., Hoder, K., Voronkov, A.: Evaluation of automated theorem proving on the Mizar mathematical library. In: ICMS. LNCS, vol. 6327, pp. 155–166 (2010)Google Scholar
  23. 23.
    Urban, J., Sutcliffe, G.: ATP-based cross-verification of Mizar proofs: method, systems, and first experiments. Math. Comput. Sci. 2(2), 231–251 (2008)MathSciNetMATHCrossRefGoogle Scholar
  24. 24.
    Urban, J., Sutcliffe, G., Pudlák, P., Vyskocil, J.: MaLARea SG1—machine learner for automated reasoning with semantic guidance. In: IJCAR. LNCS, vol. 5195, pp. 441–456 (2008)Google Scholar
  25. 25.
    Vyskocil, J., Stanovský, D., Urban, J.: Automated proof compression by invention of new definitions. In: Clarke, E.M., Voronkov, A. (eds.) LPAR (Dakar). Lecture Notes in Computer Science, vol. 6355, pp. 447–462. Springer (2010)Google Scholar

Copyright information

© Springer Science+Business Media Dordrecht 2012

Authors and Affiliations

  1. 1.Radboud UniversityNijmegenThe Netherlands
  2. 2.University of AlbertaEdmontonCanada
  3. 3.University of MiamiCoral GablesUSA

Personalised recommendations