Random Forests for Premise Selection (Q2964471)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Random Forests for Premise Selection	scientific article

Statements

scholarly article

0 references

Random Forests for Premise Selection (English)

0 references

Michael Färber

0 references

Cezary Kaliszyk

0 references

Frontiers of Combining Systems

0 references

publication date

27 February 2017

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

0 references

0 references

0 references

E Theorem Prover

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-24246-0_20

0 references

Premise selection for mathematics by corpus analysis and kernel methods

0 references

Extending Sledgehammer with SMT Solvers

0 references

Bagging predictors

0 references

0 references

Sine Qua Non for Large Theory Reasoning

0 references

MaSh: Machine Learning for Sledgehammer

0 references

MizAR 40 for Mizar 40

0 references

Learning-assisted automated reasoning with \(\mathsf{Flyspeck}\)

0 references

HOL(y)Hammer: online ATP service for HOL Light

0 references

A Brief Overview of Mizar

0 references

Theoretical comparison between the Gini Index and Information Gain criteria

0 references

System Description: E 1.8

0 references

The TPTP problem library and associated infrastructure and associated infrastructure. The FOF and CNF parts, v3.5.0

0 references

MPTP-motivation, implementation, first experiments

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-24246-0_20

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2964471

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2964471&oldid=36308088"