A Hybrid Learning Framework for Automated SAT Solver Selection
Boolean Satisfiability (SAT) solving underlies a wide range of practical applications, including hardware verification, software testing, automated planning, and combinatorial design. Decades of engineering effort have produced highly optimised Conflict-Driven Clause Learning (CDCL) solvers, yet empirical studies consi...