The Limitations and Power of NP-Oracle-Based Functional Synthesis Techniques

2025-12-23

AI Summary

This work investigates the theoretical capabilities and fundamental limitations of Boolean function synthesis (i.e., Skolem function construction) using NP oracles. Addressing the failure of existing SAT-driven approaches—such as bit-level learning and interpolation—on complex relational specifications, the paper establishes the first rigorous lower bound: when a specification admits a small Skolem function, interpolation necessarily yields exponentially large circuits in the resolution proof system. It further proves that polynomial-time synthesis requires—and is achievable with—only a constant number of NP oracle queries, establishing their indispensability. Finally, the paper introduces a novel parameterized paradigm based on the size $w$ of a minimum witness set, enabling synthesis in time $ ext{poly}(|varphi|, w)$. This significantly expands the class of tractably synthesizable specifications beyond prior methods.

Technology Category

• Constraint Satisfaction and Optimization: Satisfiability Modulo Theories
• Knowledge Representation and Reasoning: Computational Complexity of Reasoning
• Search and Optimization: Mixed Discrete/Continuous Search

Application Category

• Graph Algorithms and Modeling for the Web: Algorithms and analysis for incomplete, noisy, or partially observed Web-related graphs
• Semantics and Knowledge: Scalable techniques for the creation, curation, publication, maintenance, and consumption of large, Web-based, structured, reusable, knowledge graphs and ontologies
• Search and Retrieval-Augmented AI: Efficiency and scalability of Web search engines

Abstract

Given a Boolean relational specification between inputs and outputs, the problem of functional synthesis is to construct a function that maps each assignment of the input to an assignment of the output such that each tuple of input and output assignments meets the specification. The past decade has witnessed significant improvement in the scalability of functional synthesis tools, allowing them to handle problems with tens of thousands of variables. A common ingredient in these approaches is their reliance on SAT solvers, thereby exploiting the breakthrough advances in SAT solving over the past three decades. While the recent techniques have been shown to perform well in practice, there is little theoretical understanding of the limitations and power of these approaches. The primary contribution of this work is to initiate a systematic theoretical investigation into the power of functional synthesis approaches that rely on NP oracles. We first show that even when small Skolem functions exist, naive bit-by-bit learning approaches fail due to the relational nature of specifications. We establish fundamental limitations of interpolation-based approaches, proving that even when small Skolem functions exist, resolution-based interpolation must produce exponential-size circuits. We prove that access to an NP oracle is inherently necessary for efficient synthesis. Our main technical result shows that it is possible to use NP oracles to synthesize small Skolem functions in time polynomial in the size of the specification and the size of the smallest sufficient set of witnesses, establishing positive results for a broad class of relational specifications.

Problem

• Investigates theoretical limitations of NP-oracle-based functional synthesis techniques
• Establishes necessity of NP oracles for efficient synthesis of Boolean functions
• Shows how to synthesize small Skolem functions using NP oracles efficiently

Innovation

• Uses NP oracles for efficient functional synthesis
• Overcomes limitations of naive bit-by-bit learning
• Synthesizes small Skolem functions with polynomial time