Pages that link to "Item:Q2817933"
From MaRDI portal
The following pages link to Performance of Clause Selection Heuristics for Saturation-Based Theorem Proving (Q2817933):
Displaying 18 items.
- Vampire with a brain is a good ITP hammer (Q831938) (← links)
- Improving ENIGMA-style clause selection while learning from history (Q2055886) (← links)
- Layered clause selection for theory reasoning (short paper) (Q2096461) (← links)
- Larry Wos: visions of automated reasoning (Q2102922) (← links)
- Set of support, demodulation, paramodulation: a historical perspective (Q2102923) (← links)
- \textsf{lazyCoP}: lazy paramodulation meets neurally guided search (Q2142075) (← links)
- Contradiction separation based dynamic multi-clause synergized automated deduction (Q2198231) (← links)
- ENIGMA-NG: efficient neural and gradient-boosted inference guidance for \(\mathrm{E}\) (Q2305414) (← links)
- Old or heavy? Decaying gracefully with age/weight shapes (Q2305433) (← links)
- Faster, higher, stronger: E 2.3 (Q2305435) (← links)
- GKC: a reasoning system for large knowledge bases (Q2305438) (← links)
- Teaching Automated Theorem Proving by Example: PyRes 1.2 (Q5048999) (← links)
- The CADE-27 Automated theorem proving System Competition – CASC-27 (Q5145460) (← links)
- Making higher-order superposition work (Q5918403) (← links)
- Making higher-order superposition work (Q5918575) (← links)
- A multi-clause dynamic deduction algorithm based on standard contradiction separation rule (Q6086313) (← links)
- Saturation-based Boolean conjunctive query answering and rewriting for the guarded quantification fragments (Q6149592) (← links)
- Fully reusing clause deduction algorithm based on standard contradiction separation rule (Q6492544) (← links)