We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Modern SMT solvers have revolutionized the approach to constraint satisfaction problems by integrating advanced theory reasoning and encoding techniques. In this work, we evaluate the performance of modern SMT solvers in Z3, CVC5 and DPLL(T) against a standard SAT solver in DPLL. By benchmarking these solvers on novel, diverse 25x25 Sudoku puzzles of various difficulty levels created by our improved Sudoku generator, we examine the impact of advanced theory reasoning and encoding techniques. Our findings demonstrate that modern SMT solvers significantly outperform classical SAT solvers. This work highlights the evolution of logical solvers and exemplifies the utility of SMT solvers in addressing large-scale constraint satisfaction problems.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2501.08569")
get_code_for_paper("2501.08569")
have("2501.08569")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2501.08569.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2501.08569)
Connect an agent — have() is free.