Showing cs.AIShow all
3 papers · 1 filter
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
Better Understandings and Configurations in MaxSAT Local Search Solvers via Anytime Performance Analysis
Furong Ye, Chuan Luo, Shaowei Cai
Though numerous solvers have been proposed for the MaxSAT problem, and the benchmark environment such as MaxSAT Evaluations provides a platform for the comparison of the state-of-t…
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…