Cargando…
Learning-assisted theorem proving with millions of lemmas()
Large formal mathematical libraries consist of millions of atomic inference steps that give rise to a corresponding number of proved statements (lemmas). Analogously to the informal mathematical practice, only a tiny fraction of such statements is named and re-used in later proofs by formal mathemat...
Autores principales: | Kaliszyk, Cezary, Urban, Josef |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
Elsevier Limited
2015
|
Materias: | |
Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4599631/ https://www.ncbi.nlm.nih.gov/pubmed/26525678 http://dx.doi.org/10.1016/j.jsc.2014.09.032 |
Ejemplares similares
-
Theorems, Corollaries, Lemmas, and Methods of Proof
por: Rossi, Richard J
Publicado: (2006) -
Machine Learning Guidance for Connection Tableaux
por: Färber, Michael, et al.
Publicado: (2020) -
Symbolic logic and mechanical theorem proving
por: Chang, Chin-Liang, et al.
Publicado: (1969) -
Automated theorem proving: theory and practice
por: Newborn, Monty
Publicado: (2001) -
Symbolic logic and mechanical theorem proving
por: Chang Chin Liang, et al.
Publicado: (1973)