← Search

Saad Godil

2 accepted papers

2023

LeanDojo: Theorem Proving with Retrieval-Augmented Language Models

NeurIPS 2023oral

Large language models (LLMs) have shown promise in proving formal theorems using proof assistants such as Lean. However, existing methods are difficult to reproduce or build on, due to private code, data, and large compute requirements. This has created substantial barriers to research on machine le…

Cited by 268SourcePDFScholar
2020

Can Q-Learning with Graph Networks Learn a Generalizable Branching Heuristic for a SAT Solver?

NeurIPS 2020poster

We present Graph-Q-SAT, a branching heuristic for a Boolean SAT solver trained with value-based reinforcement learning (RL) using Graph Neural Networks for function approximation. Solvers using Graph-Q-SAT are complete SAT solvers that either provide a satisfying assignment or proof of unsatisfiabil…