--- title: "Bartosz Piotrowski — author profile and papers · Reasoning" description: "Bartosz Piotrowski, University of Warsaw: 5 papers on Elamur Research (2019–2023), h-index 7 — affiliations, topics, co-authors and who…" canonical: "https://research.elamur.ai/free/en/authors/bartosz-piotrowski/" --- [Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/authors/bartosz-piotrowski/) [home](https://md.research.elamur.ai/free/en/) / [authors](https://md.research.elamur.ai/free/en/authors/) / Bartosz Piotrowski # Bartosz Piotrowski Bartosz Piotrowski has 5 papers in our library, in 2019–2023, most of them on [Reasoning](https://md.research.elamur.ai/free/en/topics/reasoning/); often with [Josef Urban](https://md.research.elamur.ai/free/en/authors/josef-urban/), [Albert Q. Jiang](https://md.research.elamur.ai/free/en/authors/albert-q-jiang/), [Christian Szegedy](https://md.research.elamur.ai/free/en/authors/christian-szegedy/). 5 papers in our library · 2019–2023 [OpenAlex](https://openalex.org/A5024670605) · [ORCID](https://orcid.org/0000-0002-1699-018X) · [**h-index 7**](https://openalex.org/authors/A5024670605) · [19 works](https://openalex.org/works?filter=author.id:A5024670605) · [128 citations](https://openalex.org/works?filter=author.id:A5024670605&sort=cited_by_count:desc) OpenAlex, 2026-10-14 [📄 5 works in our library](https://md.research.elamur.ai/free/en/authors/bartosz-piotrowski/#papers) · [🔗 Cited 172 times in our library](https://md.research.elamur.ai/free/en/authors/bartosz-piotrowski/cited-by/) · [⭐ Paper Stars ranking: #6146](https://md.research.elamur.ai/free/en/paper-stars/page/62/#star-6146) The profile is the library's match of the name; two people with one name are not always told apart. Elsewhere: [Google Scholar](https://scholar.google.com/citations?view_op=search_authors&mauthors=Bartosz+Piotrowski) · [Semantic Scholar](https://www.semanticscholar.org/search?q=Bartosz+Piotrowski) · [dblp](https://dblp.org/search?q=Bartosz+Piotrowski) · [ACL Anthology](https://aclanthology.org/search/?q=Bartosz+Piotrowski) ## Affiliations [🎓**University of Warsaw** Warsaw · Poland 2018–2025 · 12 papers*current*](https://md.research.elamur.ai/free/en/universities/university-of-warsaw/) · [🎓**Czech Technical University in Prague** Prague · Czechia 2020–2023 · 6 papers](https://md.research.elamur.ai/free/en/universities/czech-technical-university-in-prague/) From the bylines of their papers (OpenAlex, 2026-10-14), ORCID and Wikidata; institutions on papers are matched by machine. 1 more institution on single bylines are not listed. ## Fields, topics and concepts Of its works in our library, with the number of works on each. 📚 Shelves 6 The field of science this work belongs to (OpenAlex fields).[Computer Science · 5 works](https://md.research.elamur.ai/free/en/shelves/computer-science/) · [Artificial Intelligence · 5 works](https://md.research.elamur.ai/free/en/shelves/computer-science/artificial-intelligence/) · [Computational Theory and Mathematics · 3 works](https://md.research.elamur.ai/free/en/shelves/computer-science/computational-theory-and-mathematics/) · [Arts and Humanities · 1 work](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/) · [Language and Linguistics · 1 work](https://md.research.elamur.ai/free/en/shelves/arts-and-humanities/language-and-linguistics/) · [Mathematics · 1 work](https://md.research.elamur.ai/free/en/shelves/mathematics/) 🧭 Topics 1 Research subjects and languages the work is about.[Reasoning · 3 works](https://md.research.elamur.ai/free/en/topics/reasoning/) ## Works by year ### 2020s [**2023** 2 papers](https://md.research.elamur.ai/free/en/authors/bartosz-piotrowski/year/2023/) · [**2020** 2 papers](https://md.research.elamur.ai/free/en/authors/bartosz-piotrowski/year/2020/) ### 2010s [**2019** 1 paper](https://md.research.elamur.ai/free/en/authors/bartosz-piotrowski/year/2019/) ## Papers The most cited first (OpenAlex and our library). 1. **[ProofNet: Autoformalizing and Formally Proving Undergraduate-Level Mathematics](https://md.research.elamur.ai/free/en/papers/azerbayev-2023-proofnet-autoformalizing-formally-proving-undergraduate/)** *(2023 · 142 citations)* Autoformalization means converting informal mathematics into statements a proof assistant can check. Progress has been limited by the scarcity of paired informal and formal data. Existing prover benchmarks also lean on competition problems that require only a small set of elementary facts. To address this, the… 2. **[ENIGMA Anonymous: Symbol-Independent Inference Guiding Machine (system description)](https://md.research.elamur.ai/free/en/papers/jakubuv-2020-enigma-anonymous-symbol-independent-inference/)** *(2020 · 42 citations)* Learned guidance for saturation-style provers usually relies on symbol names. Such guidance cannot carry over to problems or libraries that use different names. This system description adds two name-agnostic clause classifiers to the ENIGMA framework of the E prover. Under either classifier, consistently renaming all… 3. **[Magnushammer: A Transformer-Based Approach to Premise Selection](https://md.research.elamur.ai/free/en/papers/mikula-2023-magnushammer-transformer-based-approach-premise/)** *(2023 · 35 citations)* Premise selection means picking, from a large library of proven facts, the few that help close the current goal in a formal proof. 4. **[Stateful Premise Selection by Recurrent Neural Networks](https://md.research.elamur.ai/free/en/papers/piotrowski-2020-stateful-premise-selection-recurrent-neural/)** *(2020 · 21 citations)* Automated theorem provers that work over large formal libraries depend on premise selection, which means picking the few relevant facts from thousands of candidates. 5. **[Guiding Inferences in Connection Tableau by Recurrent Neural Networks](https://md.research.elamur.ai/free/en/papers/piotrowski-2019-guiding-inferences-connection-tableau-recurrent/)** *(2019 · 15 citations)* Connection-style theorem provers such as leanCoP must repeatedly decide which input clause to use when extending an open branch of the proof tree. ## Co-authors here 12 of 17 co-authors with a page, the most papers together first. - [Josef Urban](https://md.research.elamur.ai/free/en/authors/josef-urban/) ×3 - [Albert Q. Jiang](https://md.research.elamur.ai/free/en/authors/albert-q-jiang/) - [Christian Szegedy](https://md.research.elamur.ai/free/en/authors/christian-szegedy/) - [Dragomir Radev](https://md.research.elamur.ai/free/en/authors/dragomir-radev/) - [Edward W. Ayers](https://md.research.elamur.ai/free/en/authors/edward-w-ayers/) - [Hailey Schoelkopf](https://md.research.elamur.ai/free/en/authors/hailey-schoelkopf/) - [Jan Jakubův](https://md.research.elamur.ai/free/en/authors/jan-jakubuv/) - [Jeremy Avigad](https://md.research.elamur.ai/free/en/authors/jeremy-avigad/) - [Jin Peng Zhou](https://md.research.elamur.ai/free/en/authors/jin-peng-zhou/) - [Karel Chvalovský](https://md.research.elamur.ai/free/en/authors/karel-chvalovsky/) - [Martin Suda](https://md.research.elamur.ai/free/en/authors/martin-suda/) - [Miroslav Olšák](https://md.research.elamur.ai/free/en/authors/miroslav-olsak/) ## Venues Where their works here were published, the most works first, with the editions of those that have a page. - [Lecture notes in computer science](https://md.research.elamur.ai/free/en/venues/lecture-notes-in-computer-science/) ×2: [Lecture notes in computer science 2020](https://md.research.elamur.ai/free/en/venues/lecture-notes-in-computer-science/2020/), [Lecture notes in computer science 2019](https://md.research.elamur.ai/free/en/venues/lecture-notes-in-computer-science/2019/) - [EPiC series in computing](https://md.research.elamur.ai/free/en/venues/epic-series-in-computing/): [EPiC series in computing 2020](https://md.research.elamur.ai/free/en/venues/epic-series-in-computing/2020/) ## Cited by Papers of our library cite their works 172 times (of the 149,439 papers whose bibliographies we read); [78 citing papers with a page here →](https://md.research.elamur.ai/free/en/authors/bartosz-piotrowski/cited-by/). Updated 3 November 2026