Evaluating SAT and SMT Solvers on Large-Scale Sudoku Puzzles
We benchmark traditional SAT Solvers and modern SMT Solvers against each other with 25x25 Sudoku, deriving insights on the evolution of satisfiability.
Jan 15, 2025
Optimizations on the Stalmarck Procedure
We make optimizations in the form of clause learning and directional heuristics on the Stålmarck procedure for boolean satisfiability. This research explores how modern SAT solving techniques can enhance the classical Stålmarck algorithm, making it more practical for industry applications.
Mar 1, 2024