Machine Learner for Automated Reasoning 0.4 and 0.5

Cezary Kaliszyk; Ji\v{r}\'i Vysko\v{c}il; Josef Urban

REVIEW

Machine Learner for Automated Reasoning 0.4 and 0.5

Not yet reviewed by Pith; the record is open.

Re-run · record.json Download PDF Read on arXiv ↗

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1402.2359 v2 pith:SZ7CQLOT submitted 2014-02-11 cs.LG cs.AIcs.LO

Cezary Kaliszyk , Josef Urban , Jiří Vyskočil This is my paper

classification cs.LGcs.AIcs.LO

keywords largemalareareasoningsystemautomatedcascdescribeslearner

verification ladder T0 review T1 audit T2 compute T3 formal

0 comments

read the original 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.

Discussion (0). Sign in to comment.

Pith tools