Search Results for author:
Found 2 papers, 0 papers with code
Learn from Failure: Fine-Tuning LLMs with Trial-and-Error Data for Intuitionistic Propositional Logic Proving
Recent advances in Automated Theorem Proving have shown the effectiveness of leveraging a (large) language model that generates tactics (i. e. proof steps) to search through proof states.
Baldur: Whole-Proof Generation and Repair with Large Language Models
Recent work has developed methods to automate formal verification using proof assistants, such as Coq and Isabelle/HOL, e. g., by training a model to predict one proof step at a time, and using that model to search through the space of possible proofs.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
