Idea
A platform using large language models to optimize SAT solver heuristics for diverse problem instances, improving solver efficiency.
Research Paper
Core Innovation
This paper introduces DaSAThco, which uniquely combines large language models with problem archetypes to create diverse heuristic ensembles for SAT solvers. Unlike prior dataset-specific methods, it learns a generalizable mapping from problem features to heuristics, enabling a single model to adapt across varied SAT problems without costly re-optimization.
Market Size (TAM)
$2–10B TAM for automated algorithm optimization platforms; $1–2B SAM from software development and AI research sectors. Driven by increasing complexity of configurable systems and demand for adaptive optimization tools.
Potential Customers & Pain Points
- Software Developers Using SAT Solvers
- Researchers Needing Adaptive Solver Configurations
- Companies Facing Diverse SAT Problem Types
- AI Developers Seeking Scalable Algorithm Design
- Optimization Tool Providers Requiring Generalizable Heuristics
Business Model
Subscription-based SaaS platform offering API access to heuristic optimization services; enterprise licensing for integration with proprietary solvers.
Competitive Landscape
- AutoML frameworks
- SAT solver tuning tools
- Algorithm configuration platforms
Implementation Challenges
- Integration complexity with existing solvers
- Dependence on quality of problem feature extraction
- Adoption resistance due to solver performance variability
Validation Strategy
- Benchmark DaSAThco against standard SAT solvers on diverse datasets
- Demonstrate out-of-domain generalization in real-world problem instances
- Pilot integrations with industry partners for feedback and refinement
Research Paper Overview
DaSAThco: Data-Aware SAT Heuristics Combinations Optimization via Large Language Models
Summary
This paper presents DaSAThco, a framework that leverages Large Language Models and Problem Archetypes to generate diverse heuristic ensembles for SAT solvers. It learns a generalizable mapping from instance features to tailored heuristics, enabling a train-once model that adapts broadly across problem types. Experiments demonstrate superior performance and robust out-of-domain generalization compared to non-adaptive methods, offering a scalable approach to automated algorithm design for configurable systems.