159 citations · 646 across the 48 of their papers we have counts for
52 papers
Power Term Polynomial Algebra for Boolean Logic
Emanuele Sansone, Armando Solar-Lezama
We introduce power term polynomial algebra, a representation language for Boolean formulae designed to bridge conjunctive normal form (CNF) and algebraic normal form (ANF). The lan…
Exploring the MIT Mathematics and EECS Curriculum Using Large Language Models
Sarah J. Zhang, Samuel Florin, Ariel N. Lee +12
We curate a comprehensive dataset of 4,550 questions and solutions from problem sets, midterm exams, and final exams across all MIT Mathematics and Electrical Engineering and Compu…
Is Self-Repair a Silver Bullet for Code Generation?
Theo X. Olausson, Jeevana Priya Inala, Chenglong Wang +2
Large language models have shown remarkable aptitude in code generation, but still struggle to perform complex tasks. Self-repair -- in which the model debugs and repairs its own c…
LEMMA: Bootstrapping High-Level Mathematical Reasoning with Learned Symbolic Abstractions
Zhening Li, Gabriel Poesia, Omar Costilla-Reyes +2
Humans tame the complexity of mathematical reasoning by developing hierarchies of abstractions. With proper abstractions, solutions to hard problems can be expressed concisely, thu…
Neurosymbolic Programming for Science
Jennifer J. Sun, Megan Tjandrasuwita, Atharva Sehgal +4
Neurosymbolic Programming (NP) techniques have the potential to accelerate scientific discovery. These models combine neural and symbolic components to learn complex patterns and r…
Top-Down Synthesis for Library Learning
Matthew Bowers, Theo X. Olausson, Lionel Wong +4
This paper introduces corpus-guided top-down synthesis as a mechanism for synthesizing library functions that capture common functionality from a corpus of programs in a domain spe…