Manthan: A Data Driven Approach for Boolean Function Synthesis
Not on the map. Why?
Abstract (arXiv)
Boolean functional synthesis is a fundamental problem in computer science with wide-ranging applications and has witnessed a surge of interest resulting in progressively improved techniques over the past decade. Despite intense algorithmic development, a large number of problems remain beyond the reach of the state of the art techniques. Motivated by the progress in machine learning, we propose Manthan, a novel data-driven approach to Boolean functional synthesis. Manthan views functional synthesis as a classification problem, relying on advances in constrained sampling for data generation, and advances in automated reasoning for a novel proof-guided refinement and provable verification. On an extensive and rigorous evaluation over 609 benchmarks, we demonstrate that Manthan significantly improves upon the current state of the art, solving 356 benchmarks in comparison to 280, which is the most solved by a state of the art technique; thereby, we demonstrate an increase of 76 benchmarks over the current state of the art. Furthermore, Manthan solves 60 benchmarks that none of the current state of the art techniques could solve. The significant performance improvements, along with our detailed analysis, highlights several interesting avenues of future work at the intersection of machine learning, constrained sampling, and automated reasoning.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 14 May 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 4; 2022: 1; 2023: 3; 2024: 1; 2025: 2.
11 papers.
- 2021Engineering an Efficient Boolean Functional Synthesis Enginecited by 3
- 2021A Normal Form Characterization for Efficient Boolean Skolem Function Synthesiscited by 2
- 2021Projected Model Counting: Beyond Independent Supportcited by 2
- 2023Lightweight Online Learning for Sets of Related Problems in Automated Reasoningcited by 2
- 2024Model Counting in the Wildcited by 2
- 2023Synthesising Recursive Functions for First-Order Model Counting: Challenges, Progress, and Conjecturescited by 1
- 2025Formally Solving Answer-Construction Problems in Leancited by 1
- 2021Program Synthesis as Dependency Quantified Formula Modulo Theorycited by 0
- 2022BNSynth: Bounded Boolean Functional Synthesiscited by 0
- 2023Synthesis with Explicit Dependenciescited by 0
- 2025Presburger Functional Synthesis: Complexity and Tractable Normal Formscited by 0
- 2025Presburger Functional Synthesis: Complexity and Tractable Normal Forms10 Aug 2025
- 2025Formally Solving Answer-Construction Problems in Lean24 May 2025
- 2024Model Counting in the Wild13 Aug 2024
- 2023Synthesising Recursive Functions for First-Order Model Counting: Challenges, Progress, and Conjectures7 Jun 2023
- 2023Lightweight Online Learning for Sets of Related Problems in Automated Reasoning18 May 2023
- 2023Synthesis with Explicit Dependencies25 Jan 2023
- 2022BNSynth: Bounded Boolean Functional Synthesis15 Dec 2022
- 2021Projected Model Counting: Beyond Independent Support18 Oct 2021
- 2021Engineering an Efficient Boolean Functional Synthesis Engine12 Aug 2021
- 2021Program Synthesis as Dependency Quantified Formula Modulo Theory19 May 2021
- 2021A Normal Form Characterization for Efficient Boolean Skolem Function Synthesis29 Apr 2021