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
Two Strategies to Improve the Stålmarck Procedure
We develop an open source modern re-implementation Stålmarck procedure for boolean satisfiability, and explore two strategies in CDB and DPO to improve the performance of the procedure.
Mar 1, 2024