Search Results for author: Lasse Blaauwbroek

Found 6 papers, 0 papers with code

Learning Guided Automated Reasoning: A Brief Survey

no code implementations6 Mar 2024 Lasse Blaauwbroek, David Cerna, Thibault Gauthier, Jan Jakubův, Cezary Kaliszyk, Martin Suda, Josef Urban

Automated theorem provers and formal proof assistants are general reasoning systems that are in theory capable of proving arbitrarily hard theorems, thus solving arbitrary problems reducible to mathematics and logical reasoning.

Automated Theorem Proving Logical Reasoning +1

Graph2Tac: Learning Hierarchical Representations of Math Concepts in Theorem proving

no code implementations5 Jan 2024 Jason Rute, Miroslav Olšák, Lasse Blaauwbroek, Fidel Ivan Schaposnik Massolo, Jelle Piepenbrock, Vasily Pestun

G2T is an online model that is deeply integrated into the users' workflow and can adapt in real time to new Coq projects and their definitions.

Automated Theorem Proving Math

The Tactician's Web of Large-Scale Formal Knowledge

no code implementations5 Jan 2024 Lasse Blaauwbroek

The Tactician's Web is a platform offering a large web of strongly interconnected, machine-checked, formal mathematical knowledge conveniently packaged for machine learning, analytics, and proof engineering.

Online Machine Learning Techniques for Coq: A Comparison

no code implementations12 Apr 2021 Liao Zhang, Lasse Blaauwbroek, Bartosz Piotrowski, Prokop Černý, Cezary Kaliszyk, Josef Urban

Learning happens in an online manner, meaning that Tactician's machine learning model is updated immediately every time the user performs a step in an interactive proof.

BIG-bench Machine Learning

Tactic Learning and Proving for the Coq Proof Assistant

no code implementations20 Mar 2020 Lasse Blaauwbroek, Josef Urban, Herman Geuvers

Currently, our predictor can identify the correct tactic to be applied to a proof state 23. 4% of the time.

Cannot find the paper you are looking for? You can Submit a new open access paper.