The following pages link to Mathias Fleury (Q287337):
Displaying 14 items.
- Semi-intelligible Isar proofs from machine-generated proofs (Q287340) (← links)
- A verified SAT solver framework with learn, forget, restart, and incrementality (Q1663234) (← links)
- Foundational (co)datatypes and (co)recursion for higher-order logic (Q1687535) (← links)
- Reliable reconstruction of fine-grained proofs in a proof assistant (Q2055877) (← links)
- Efficient all-UIP learned clause minimization (Q2118297) (← links)
- SPASS-SATT. A CDCL(LA) solver (Q2305409) (← links)
- Distributed cube and conquer with Paracooba (Q2661340) (← links)
- A Verified SAT Solver Framework with Learn, Forget, Restart, and Incrementality (Q2817909) (← links)
- Better Decision Heuristics in CDCL through Local Search and Target Phases (Q5101311) (← links)
- (Q5111307) (← links)
- Scalable fine-grained proofs for formula processing (Q5919479) (← links)
- Mining definitions in Kissat with Kittens (Q6056639) (← links)
- Faster LRAT checking than solving with CaDiCaL (Q6643101) (← links)
- Practical algebraic calculus and Nullstellensatz with the checkers Pacheck and Pastèque and Nuss-Checker (Q6661748) (← links)
