Pages that link to "Item:Q485842"
From MaRDI portal
The following pages link to Learning-assisted theorem proving with millions of lemmas (Q485842):
Displaying 16 items.
- Recycling proof patterns in Coq: case studies (Q475385) (← links)
- Aligning concepts across proof assistant libraries (Q1640642) (← links)
- The role of the Mizar mathematical library for interactive proof development in Mizar (Q1663215) (← links)
- Hammer for Coq: automation for dependent type theory (Q1663240) (← links)
- Proving theorems by reuse (Q1978233) (← links)
- Learning-assisted automated reasoning with \(\mathsf{Flyspeck}\) (Q2351415) (← links)
- Proof mining with dependent types (Q2364689) (← links)
- Lemmatization for Stronger Reasoning in Large Theories (Q2964472) (← links)
- Higher-Order Modal Logics: Automation and Applications (Q2970308) (← links)
- Learning domain knowledge to improve theorem proving (Q4647500) (← links)
- Machine Learning for Automated Theorem Proving: Learning to Solve SAT and QSAT (Q5026334) (← links)
- A FORMAL PROOF OF THE KEPLER CONJECTURE (Q5280247) (← links)
- Lemma Learning in SMT on Linear Constraints (Q5756582) (← links)
- Machine Learning for Inductive Theorem Proving (Q6108816) (← links)
- Lemmas: generation, selection, application (Q6541149) (← links)
- Synergies between machine learning and reasoning -- an introduction by the Kay R. Amel group (Q6577680) (← links)