1 code implementation • 6 Jun 2024 • Alicja Ziarko, Albert Q. Jiang, Bartosz Piotrowski, Wenda Li, Mateja Jamnik, Piotr Miłoś
Text embeddings are essential for many tasks, such as document retrieval, clustering, and semantic similarity assessment.
1 code implementation • 17 Mar 2023 • Bartosz Piotrowski, Ramon Fernández Mir, Edward Ayers
For this purpose, we designed a custom version of the random forest model, trained in an online fashion.
no code implementations • 12 Mar 2023 • Jan Jakubův, Karel Chvalovský, Zarathustra Goertzel, Cezary Kaliszyk, Mirek Olšák, Bartosz Piotrowski, Stephan Schulz, Martin Suda, Josef Urban
As a present to Mizar on its 50th anniversary, we develop an AI/TP system that automatically proves about 60\% of the Mizar theorems in the hammer setting.
no code implementations • 8 Mar 2023 • Maciej Mikuła, Szymon Tworkowski, Szymon Antoniak, Bartosz Piotrowski, Albert Qiaochu Jiang, Jin Peng Zhou, Christian Szegedy, Łukasz Kuciński, Piotr Miłoś, Yuhuai Wu
By combining \method with a language-model-based automated theorem prover, we further improve the state-of-the-art proof success rate from $57. 0\%$ to $71. 0\%$ on the PISA benchmark using $4$x fewer parameters.
2 code implementations • 24 Feb 2023 • Zhangir Azerbayev, Bartosz Piotrowski, Hailey Schoelkopf, Edward W. Ayers, Dragomir Radev, Jeremy Avigad
We introduce ProofNet, a benchmark for autoformalization and formal proving of undergraduate-level mathematics.
no code implementations • 12 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.
no code implementations • 11 Mar 2020 • Bartosz Piotrowski, Josef Urban
In this work, we develop a new learning-based method for selecting facts (premises) when proving new goals over large formal libraries.
no code implementations • 13 Feb 2020 • Jan Jakubův, Karel Chvalovský, Miroslav Olšák, Bartosz Piotrowski, Martin Suda, Josef Urban
For the neural guidance, we use symbol-independent graph neural networks (GNNs) and their embedding of the terms and clauses.
no code implementations • 7 Nov 2019 • Bartosz Piotrowski, Josef Urban, Chad E. Brown, Cezary Kaliszyk
This work investigates if the current neural architectures are adequate for learning symbolic rewriting.
1 code implementation • 20 May 2019 • Bartosz Piotrowski, Josef Urban
We present a dataset and experiments on applying recurrent neural networks (RNNs) for guiding clause selection in the connection tableau proof calculus.
1 code implementation • 9 Feb 2018 • Bartosz Piotrowski, Josef Urban
ATPboost is a system for solving sets of large-theory problems by interleaving ATP runs with state-of-the-art machine learning of premise selection from the proofs.