Pages that link to "Item:Q4647531"
From MaRDI portal
The following pages link to Optimizing proof search in model elimination (Q4647531):
Displaying 16 items.
- Learning-assisted theorem proving with millions of lemmas (Q485842) (← links)
- Proof optimization for partial redundancy elimination (Q843219) (← links)
- HOL(y)Hammer: online ATP service for HOL Light (Q2018657) (← links)
- GRUNGE: a grand unified ATP challenge (Q2305410) (← links)
- Learning-assisted automated reasoning with \(\mathsf{Flyspeck}\) (Q2351415) (← links)
- Predicate Elimination for Preprocessing in First-Order Theorem Proving (Q2818027) (← links)
- (Q3384900) (← links)
- Optimizing a Certified Proof Checker for a Large-Scale Computer-Generated Proof (Q3453106) (← links)
- Subgoal alternation in model elimination (Q4610327) (← links)
- An Implementation of the Model Elimination Proof Procedure (Q4770008) (← links)
- (Q4860660) (← links)
- Loop Elimination, a Sound Optimisation Technique for PTTP Related Theorem Proving (Q4898739) (← links)
- Controlled use of clausal lemmas in connection tableau calculi (Q5927985) (← links)
- Mechanising Gödel-Löb provability logic in HOL light (Q6050769) (← links)
- Machine Learning for Inductive Theorem Proving (Q6108816) (← links)
- A Mizar mode for HOL (Q6567713) (← links)