Pages that link to "Item:Q3460043"
From MaRDI portal
The following pages link to FEMaLeCoP: Fairly Efficient Machine Learning Connection Prover (Q3460043):
Displaying 16 items.
- FEMaLeCoP (Q32991) (← links)
- TacticToe: learning to prove with tactics (Q2031416) (← links)
- Machine learning guidance for connection tableaux (Q2031418) (← links)
- Towards finding longer proofs (Q2142073) (← links)
- \textsf{lazyCoP}: lazy paramodulation meets neurally guided search (Q2142075) (← links)
- The role of entropy in guiding a connection prover (Q2142077) (← links)
- The \textsf{nanoCoP 2.0} connection provers for classical, intuitionistic and modal logics (Q2142078) (← links)
- ENIGMA-NG: efficient neural and gradient-boosted inference guidance for \(\mathrm{E}\) (Q2305414) (← links)
- ENIGMA: efficient learning-based inference guiding machine (Q2364687) (← links)
- Portfolio theorem proving and prover runtime prediction for geometry (Q2631959) (← links)
- Craig interpolation with clausal first-order tableaux (Q2666953) (← links)
- nanoCoP: A Non-clausal Connection Prover (Q2817929) (← links)
- Internal Guidance for Satallax (Q2817934) (← links)
- Prolog Technology Reinforcement Learning Prover (Q5049033) (← links)
- Hammering Mizar by Learning Clause Guidance (Short Paper). (Q5875448) (← links)
- A multi-clause dynamic deduction algorithm based on standard contradiction separation rule (Q6086313) (← links)
