Machine Learner for Automated Reasoning 0.4 and 0.5

7 pages•Published: July 5, 2015

Cezary Kaliszyk, Josef Urban and Jiri Vyskocil

Abstract

Machine Learner for Automated Reasoning (MaLARea) is a learning and
reasoning system for proving in large formal libraries where
thousands of theorems are available when attacking a new
conjecture, and a large number of related problems and proofs can be used to
learn specific theorem-proving knowledge. The last version of the
system has by a large margin won the 2013 CASC LTB competition. This
paper describes the motivation behind the methods used in MaLARea,
discusses the general approach and the issues arising in evaluation
of such system, and describes the Mizar@Turing100 and CASC'24
versions of MaLARea.

Keyphrases: atp competitions, automated reasoning, formal mathematics, large theories, machine learning

In: Stephan Schulz, Leonardo De Moura and Boris Konev (editors). PAAR-2014. 4th Workshop on Practical Aspects of Automated Reasoning, vol 31, pages 60-66.

Links:	https://easychair.org/publications/paper/W7
	https://doi.org/10.29007/shxj

BibTeX entry

@inproceedings{PAAR-2014:Machine_Learner_Automated_Reasoning,
  author    = {Cezary Kaliszyk and Josef Urban and Jiri Vyskocil},
  title     = {Machine Learner for Automated Reasoning 0.4 and 0.5},
  booktitle = {PAAR-2014. 4th Workshop on Practical Aspects of Automated Reasoning},
  editor    = {Stephan Schulz and Leonardo De Moura and Boris Konev},
  series    = {EPiC Series in Computing},
  volume    = {31},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/W7},
  doi       = {10.29007/shxj},
  pages     = {60-66},
  year      = {2015}}

Download PDF Open PDF in browser