The following pages link to Faster, higher, stronger: E 2.3 (Q2305435):
Displaying 38 items.
- E Theorem Prover (Q22154) (← links)
- A Datalog hammer for supervisor verification conditions modulo simple linear arithmetic (Q831915) (← links)
- Fast and slow enigmas and parental guidance (Q831937) (← links)
- Vampire with a brain is a good ITP hammer (Q831938) (← links)
- Learning from Łukasiewicz and Meredith: investigations into proof structures (Q2055843) (← links)
- Superposition with first-class booleans and inprocessing clausification (Q2055873) (← links)
- Neural precedence recommender (Q2055885) (← links)
- Improving ENIGMA-style clause selection while learning from history (Q2055886) (← links)
- Twee: an equational theorem prover (Q2055894) (← links)
- Subsumption demodulation in first-order theorem proving (Q2096454) (← 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)
- A posthumous contribution by Larry Wos: excerpts from an unpublished column (Q2102925) (← links)
- Local is best: efficient reductions to modal logic \textsf{K} (Q2102930) (← links)
- Local reductions for the modal cube (Q2104538) (← links)
- Guiding an automated theorem prover with neural rewriting (Q2104548) (← links)
- The \textsf{nanoCoP 2.0} connection provers for classical, intuitionistic and modal logics (Q2142078) (← links)
- Eliminating models during model elimination (Q2142079) (← links)
- Craig interpolation with clausal first-order tableaux (Q2666953) (← links)
- (Q4989394) (← links)
- Teaching Automated Theorem Proving by Example: PyRes 1.2 (Q5048999) (← links)
- Make E Smart Again (Short Paper) (Q5049019) (← links)
- A Programmer’s Text Editor for a Logical Theory: The SUMOjEdit Editor (System Description) (Q5049030) (← links)
- The CADE-28 Automated Theorem Proving System Competition – CASC-28 (Q5069650) (← links)
- SAT-Inspired Eliminations for Superposition (Q5875949) (← links)
- Superposition with lambdas (Q5918381) (← links)
- Making higher-order superposition work (Q5918403) (← links)
- Making higher-order superposition work (Q5918575) (← links)
- The 11th IJCAR automated theorem proving system competition – CASC-J11 (Q6095787) (← links)
- Semantically-guided goal-sensitive reasoning: decision procedures and the Koala prover (Q6156634) (← links)
- Fully reusing clause deduction algorithm based on standard contradiction separation rule (Q6492544) (← links)
- ALASCA: reasoning in quantified linear arithmetic (Q6535381) (← links)
- Extending a high-performance prover to higher-order logic (Q6536126) (← links)
- Range-restricted and Horn interpolation through clausal tableaux (Q6541142) (← links)
- Lemmas: generation, selection, application (Q6541149) (← links)
- \texttt{gym-saturation}: gymnasium environments for saturation provers (system description) (Q6541151) (← links)
- Investigations into proof structures (Q6653096) (← links)
