MaLeCoP: Machine Learning Connection Prover

43Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Probabilistic guidance based on learned knowledge is added to the connection tableau calculus and implemented on top of the lean-CoP theorem prover, linking it to an external advisor system. In the typical mathematical setting of solving many problems in a large complex theory, learning from successful solutions is then used for guiding theorem proving attempts in the spirit of the MaLARea system. While in MaLA Rea learning-based axiom selection is done outside unmodified theorem provers, in MaLeCoP the learning-based selection is done inside the prover, and the interaction between learning of knowledge and its application can be much finer. This brings interesting possibilities for further construction and training of self-learning AI mathematical experts on large mathematical libraries, some of which are discussed. The initial implementation is evaluated on the MPTP Challenge large theory benchmark. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Urban, J., Vyskočil, J., & Štěpánek, P. (2011). MaLeCoP: Machine Learning Connection Prover. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6793 LNAI, pp. 263–277). https://doi.org/10.1007/978-3-642-22119-4_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free