Lemma mining over HOL Light
C Kaliszyk, J Urban - International Conference on Logic for Programming …, 2013 - Springer
… by rigorous experimental evaluations of the proposed methods over the existing corpora.
For the first experiments with lemma mining we use the HOL Light system, together with its core …
For the first experiments with lemma mining we use the HOL Light system, together with its core …
[HTML][HTML] Learning-assisted theorem proving with millions of lemmas
C Kaliszyk, J Urban - Journal of symbolic computation, 2015 - Elsevier
… and explaining the overall approach for using lemmas in large theories in Section 2 and …
over the existing corpora. For the first experiments with lemma mining we use the HOL Light …
over the existing corpora. For the first experiments with lemma mining we use the HOL Light …
HOL(y)Hammer: Online ATP Service for HOL Light
C Kaliszyk, J Urban - Mathematics in Computer Science, 2015 - Springer
… -selection techniques2 for HOL Light, and … HOL Light/Flyspeck user a 47 % chance (when
using 14 CPUs, each for 30 s) that he will not have to search the library for suitable lemmas …
using 14 CPUs, each for 30 s) that he will not have to search the library for suitable lemmas …
Matching concepts across HOL libraries
T Gauthier, C Kaliszyk - … Conference on Intelligent Computer Mathematics, 2014 - Springer
… We evaluate the approach on HOL based proof assistants HOL4, HOL Light and Isabelle/HOL, …
Using subsumption in order to find duplicate lemmas has been explored in the MoMM …
Using subsumption in order to find duplicate lemmas has been explored in the MoMM …
Holist: An environment for machine learning of higher order logic theorem proving
… only 1602 theorems and lemmas, while ours features 29462 theorems and lemmas. Besides
… aspects of our neural network architecture and the hard negative mining methodology. …
… aspects of our neural network architecture and the hard negative mining methodology. …
Proof Mining and the Convex Feasibility Problem: the Curious Case of Dykstra's Algorithm
P Pinto - 2024 - publications.mfo.de
… We can now instantiate the function γ with the output from Lemma 3.2 to immediately
obtain the following two results. In a Hilbert space X, consider (Tn)n∈N a countable family of …
obtain the following two results. In a Hilbert space X, consider (Tn)n∈N a countable family of …
[HTML][HTML] Formalization of functional variation in HOL Light
J Zhang, G Wang, Z Shi, Y Guan, Y Li - … of Logical and Algebraic Methods in …, 2019 - Elsevier
… HOL Light system, which is a widely used higher-order-logic theorem prover. The main reason
for choosing HOL Light … So, sub-goal 2 can be verified by using Lemma 3 and Lemma 1 in …
for choosing HOL Light … So, sub-goal 2 can be verified by using Lemma 3 and Lemma 1 in …
The complexity of mining maximal frequent itemsets and maximal frequent patterns
G Yang - … conference on Knowledge discovery and data mining, 2004 - dl.acm.org
… The notion of maximal occurrent itemsets plays an important role in our complexity analysis
of mining maximal frequent itemsets. In the following Section 4 we will develop lemmas to …
of mining maximal frequent itemsets. In the following Section 4 we will develop lemmas to …
[PDF][PDF] Improved algorithmic versions of the Lovász local lemma
A Srinivasan - … of the nineteenth annual ACM-SIAM symposium on …, 2008 - cs.umd.edu
… Lemma. However, with some exceptions, there is a significant gap between what one can
prove using the original Lemma … version of the Local Lemma for hypergraph coloring due to …
prove using the original Lemma … version of the Local Lemma for hypergraph coloring due to …
A formalisation in HOL of the fundamental theorem of linear algebra and its application to the solution of the least squares problem
… HOL Light to Isabelle/HOL is far from complete. It is mainly being done by hand and, apparently,
translating HOL Light … (the proof is lemma in file QR_Efficient of our development [23]). …
translating HOL Light … (the proof is lemma in file QR_Efficient of our development [23]). …