The Weighted Partial MaxSAT (WPMS) problem requires finding an assignment that satisfies all hard clauses while maximizing the total weight of satisfied soft clauses. From a computational perspective, WPMS is not merely an extension of the uniform-weight Partial MaxSAT (PMS); rather, it requires search strategies that...
Jialu Zhang, Chumin Li, Sami Cherif et al.· Proceedings of the Thirty-Fi...· 0 citations
The Maximum Weight Clique Problem (MWCP) is NP-hard and is typically solved exactly within a Branch-and-Bound (BnB) framework, where the quality of upper bounds critically determines the pruning efficiency. Recent solvers enhance independent-set-based bounds using MaxSAT reasoning. However, their effectiveness is limit...
Mingming Jin, Chumin Li, Kun He· Proceedings of the Thirty-Fi...· 0 citations
This paper introduces AESAT (Auto-Evolving SAT solving), a novel neuro-symbolic framework designed to automatically evolve and optimize the heuristic functions of SAT solvers, and represents the first time an LLM-enhanced solver has dominated the world's premier SAT competition.
Mao Luo, Hang Ding, Chumin Li et al.· Proceedings of the Thirty-Fi...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
