Machine Learner for Automated Reasoning 0.4 and 0.5

02/11/2014
by   Cezary Kaliszyk, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/11/2014

Learning-assisted Theorem Proving with Millions of Lemmas

Large formal mathematical libraries consist of millions of atomic infere...
research
05/06/2020

Towards Concise, Machine-discovered Proofs of Gödel's Two Incompleteness Theorems

There is an increasing interest in applying recent advances in AI to aut...
research
08/09/2013

MaLeS: A Framework for Automatic Tuning of Automated Theorem Provers

MaLeS is an automatic tuning framework for automated theorem provers. It...
research
09/03/2011

ATP and Presentation Service for Mizar Formalizations

This paper describes the Automated Reasoning for Mizar (MizAR) service, ...
research
03/06/2019

GRUNGE: A Grand Unified ATP Challenge

This paper describes a large set of related theorem proving problems obt...
research
09/21/2000

Computing Presuppositions by Contextual Reasoning

This paper describes how automated deduction methods for natural languag...
research
02/28/2020

Towards a Geometry Automated Provers Competition

The geometry automated theorem proving area distinguishes itself by a la...

Please sign up or login with your details

Forgot password? Click here to reset