{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T08:50:53Z","timestamp":1725612653219},"reference-count":0,"publisher":"EasyChair","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"abstract":"n&lt;sup&gt;2&lt;\/sup&gt; x n&lt;sup&gt;2&lt;\/sup&gt; Sudoku puzzles can be straightforwardly encoded as SAT problems. However, solving such puzzles for large n requires a significant amount of optimization. We present some ideas for reducing the number of clauses, for improving the encoding, and for the selection of suitable SAT solvers.<\/jats:p>","DOI":"10.29007\/79mc","type":"proceedings-article","created":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T22:57:35Z","timestamp":1516748255000},"page":"52-45","source":"Crossref","is-referenced-by-count":1,"title":["A Sudoku-Solver for Large Puzzles using SAT"],"prefix":"10.29007","volume":"13","author":[{"given":"Uwe","family":"Pfeiffer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomas","family":"Karnagel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guido","family":"Scheffler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"11545","event":{"name":"LPAR-17-short. short papers for 17th International Conference on Logic for Programming, Artificial intelligence, and Reasoning."},"container-title":["EPiC Series in Computing"],"original-title":[],"deposited":{"date-parts":[[2018,1,23]],"date-time":"2018-01-23T22:58:37Z","timestamp":1516748317000},"score":1,"resource":{"primary":{"URL":"https:\/\/easychair.org\/publications\/paper\/VF3m"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":0,"URL":"https:\/\/doi.org\/10.29007\/79mc","relation":{},"ISSN":["2398-7340"],"issn-type":[{"type":"print","value":"2398-7340"}],"subject":[]}}