--- title: "Thibault Gauthier — author profile and papers · Reasoning" description: "Thibault Gauthier: 2 papers on Elamur Research (2018–2019), h-index 10 — affiliations, topics, co-authors and who cites them in our library." canonical: "https://research.elamur.ai/free/en/authors/thibault-gauthier/" --- [Elamur Research](https://md.research.elamur.ai/free/en/) · [this page in HTML](https://research.elamur.ai/free/en/authors/thibault-gauthier/) [home](https://md.research.elamur.ai/free/en/) / [authors](https://md.research.elamur.ai/free/en/authors/) / Thibault Gauthier # Thibault Gauthier Thibault Gauthier has 2 papers in our library, in 2018–2019, most of them on [Reasoning](https://md.research.elamur.ai/free/en/topics/reasoning/); often with [Cezary Kaliszyk](https://md.research.elamur.ai/free/en/authors/cezary-kaliszyk/), [Josef Urban](https://md.research.elamur.ai/free/en/authors/josef-urban/), [Michael Norrish](https://md.research.elamur.ai/free/en/authors/michael-norrish/). 2 papers in our library · 2018–2019 [OpenAlex](https://openalex.org/A5048490198) · [ORCID](https://orcid.org/0000-0002-7348-0602) · [**h-index 10**](https://openalex.org/authors/A5048490198) · [25 works](https://openalex.org/works?filter=author.id:A5048490198) · [229 citations](https://openalex.org/works?filter=author.id:A5048490198&sort=cited_by_count:desc) OpenAlex, 2026-10-14 [📄 2 works in our library](https://md.research.elamur.ai/free/en/authors/thibault-gauthier/#papers) · [🔗 Cited 17 times in our library](https://md.research.elamur.ai/free/en/authors/thibault-gauthier/cited-by/) · [⭐ Paper Stars ranking: #9077](https://md.research.elamur.ai/free/en/paper-stars/page/91/#star-9077) 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=Thibault+Gauthier) · [Semantic Scholar](https://www.semanticscholar.org/search?q=Thibault+Gauthier) · [dblp](https://dblp.org/search?q=Thibault+Gauthier) · [ACL Anthology](https://aclanthology.org/search/?q=Thibault+Gauthier) ## Affiliations [🎓**Universität Innsbruck** Innsbruck · Austria 2014–2020 · 11 papers](https://md.research.elamur.ai/free/en/universities/universitat-innsbruck/) · [🎓**Czech Technical University in Prague** Prague · Czechia 2019–2024 · 10 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. ## Fields, topics and concepts Of its works in our library, with the number of works on each. 📚 Shelves 3 The field of science this work belongs to (OpenAlex fields).[Computer Science · 2 works](https://md.research.elamur.ai/free/en/shelves/computer-science/) · [Artificial Intelligence · 2 works](https://md.research.elamur.ai/free/en/shelves/computer-science/artificial-intelligence/) · [Computational Theory and Mathematics · 1 work](https://md.research.elamur.ai/free/en/shelves/computer-science/computational-theory-and-mathematics/) 🧭 Topics 1 Research subjects and languages the work is about.[Reasoning · 2 works](https://md.research.elamur.ai/free/en/topics/reasoning/) ## Works by year ### 2010s [**2019** 1 paper](https://md.research.elamur.ai/free/en/authors/thibault-gauthier/year/2019/) · [**2018** 1 paper](https://md.research.elamur.ai/free/en/authors/thibault-gauthier/year/2018/) ## Papers The most cited first (OpenAlex and our library). 1. **[TacticToe: Learning to Prove with Tactics](https://md.research.elamur.ai/free/en/papers/gauthier-2018-tactictoe-learning-prove-tactics/)** *(2018 · 57 citations)* In interactive theorem provers such as HOL4, users build proofs by applying tactics, high-level steps that transform a goal into simpler subgoals. 2. **[Deep Reinforcement Learning for Synthesizing Functions in Higher-Order Logic](https://md.research.elamur.ai/free/en/papers/gauthier-2019-deep-reinforcement-learning-synthesizing-functions/)** *(2019 · 15 citations)* The paper explores whether theorem-proving-style search can be guided by neural networks that teach themselves, rather than by hand-crafted heuristics. ## Co-authors here 4 co-authors with a page, the most papers together first. - [Cezary Kaliszyk](https://md.research.elamur.ai/free/en/authors/cezary-kaliszyk/) - [Josef Urban](https://md.research.elamur.ai/free/en/authors/josef-urban/) - [Michael Norrish](https://md.research.elamur.ai/free/en/authors/michael-norrish/) - [Ramana Kumar](https://md.research.elamur.ai/free/en/authors/ramana-kumar/) ## Venues Where their works here were published, the most works first, with the editions of those that have a page. - [EPiC series in computing](https://md.research.elamur.ai/free/en/venues/epic-series-in-computing/): [EPiC series in computing 2019](https://md.research.elamur.ai/free/en/venues/epic-series-in-computing/2019/) - [Journal of Automated Reasoning](https://md.research.elamur.ai/free/en/venues/journal-of-automated-reasoning/): [Journal of Automated Reasoning 2018](https://md.research.elamur.ai/free/en/venues/journal-of-automated-reasoning/2018/) ## Cited by Papers of our library cite their works 17 times (of the 149,439 papers whose bibliographies we read); [12 citing papers with a page here →](https://md.research.elamur.ai/free/en/authors/thibault-gauthier/cited-by/). Updated 3 November 2026