3 papers
cs.AI2026
Discovering heuristics in a complex SAT solver with large language models
Yiwen Sun, Furong Ye, Zhihan Chen +2
The Satisfiability problem (SAT) is fundamental in computational complexity theory and has a wide range of industrial applications. Optimizing modern SAT solvers in real-world sett…
cs.AI2025
AutoPBO: LLM-powered Optimization for Local Search PBO Solvers
Jinyuan Li, Yi Chu, Yiwen Sun +2
Pseudo-Boolean Optimization (PBO) provides a powerful framework for modeling combinatorial problems through pseudo-Boolean (PB) constraints. Local search solvers have shown excelle…
cs.AI2024
AutoSAT: Automatically Optimize SAT Solvers via Large Language Models
Yiwen Sun, Furong Ye, Xianyin Zhang +4
Conflict-Driven Clause Learning (CDCL) is the mainstream framework for solving the Satisfiability problem (SAT), and CDCL solvers typically rely on various heuristics, which have a…