Elamur Research⌕
☰
home / authors / Leonardo de Moura

Leonardo de Moura

Leonardo de Moura has 2 papers in our library, in 2018–2021, most of them on Reasoning, Code & programming languages; often with Daniel Selsam, Matthew Lamm, Percy Liang.

2 papers in our library · 2018–2021

OpenAlex · ORCID · Wikidata · h-index 39 · 91 works · 12,771 citations OpenAlex, 2026-10-14

📄 2 works in our library · 🔗 Cited 211 times in our library · ⭐ Paper Stars ranking: #4943

The profile is the library's match of the name; two people with one name are not always told apart.

Elsewhere: Google Scholar · Semantic Scholar · dblp · ACL Anthology

 Affiliations

🏢AmazonSeattle · United States2026 · 1 papercurrent🏢MicrosoftRedmond · United States2007–2022 · 62 papers🔬SRI InternationalMenlo Park · United States2003–2006 · 13 papers
🏛️Amazon Web ServicesUnited States2023Employment since 2023
🏛️Microsoft ResearchUnited States2006–2023Employment 2006–2023
🎓Pontifícia Universidade Católica do Rio de JaneiroRio de Janeiro · BrazilEducation

From the bylines of their papers (OpenAlex, 2026-10-14), ORCID and Wikidata; institutions on papers are matched by machine. 2 more institutions on single bylines are not listed.

 Fields, topics and concepts

Of its works in our library, with the number of works on each.

📚 Shelves 5The field of science this work belongs to (OpenAlex fields).Computer Science · 1 workMathematics · 1 workArtificial Intelligence · 1 workComputational Theory and Mathematics · 1 workComputer Networks and Communications · 1 work

🧭 Topics 2Research subjects and languages the work is about.Code & programming languages · 1 workReasoning · 1 work

 Works by year

2020s

20211 paper

2010s

20181 paper

 Papers

The most cited first (OpenAlex and our library).

  1. Learning a SAT Solver from Single-Bit Supervision (2018 · 232 citations)
    Selsam et al. ask whether a neural network can learn to solve propositional satisfiability (SAT), an NP-complete problem, when it is told only whether each instance is satisfiable. They build NeuroSAT, a message passing neural network (MPNN). It represents a CNF formula as a graph of literal and clause nodes and…
  2. The Lean 4 Theorem Prover and Programming Language (System Description) (2021 · 155 citations)
    Lean 3 owed much of its success to metaprogramming. However, large parts of the system were written in C++ and could not be changed by users. Its metaprograms also ran on an interpreting virtual machine, so custom proof automation lagged behind tools written in OCaml or C++. Lean 4 solves this by rewriting the prover…

 Co-authors here

3 co-authors with a page, the most papers together first.

Venues

Where their works here were published, the most works first, with the editions of those that have a page.

 Cited by

Papers of our library cite their works 211 times (of the 149,439 papers whose bibliographies we read); 35 citing papers with a page here →.

Updated

This page in Markdown → https://md.research.elamur.ai/free/en/authors/leonardo-de-moura/