(function(doc, html, url) { var widget = doc.createElement("div"); widget.innerHTML = html; var script = doc.currentScript; // e = a.currentScript; if (!script) { var scripts = doc.scripts; for (var i = 0; i < scripts.length; ++i) { script = scripts[i]; if (script.src && script.src.indexOf(url) != -1) break; } } script.parentElement.replaceChild(widget, script); }(document, '

Applying modern SAT-solvers to solving hard problems

What is it about?

We present SAT-based encodings of several well-known combinatorial and decision problems and we use them as benchmarks to compare the efficiency of a few popular SAT-solvers. In addition to several known reductions to SAT for the problems of graph k-colouring, vertex k-cover, Hamiltonian path, and verification of UML systems, we also define new original reductions for the N-queens problem, the knight’s tour problem, towers of Hanoi, extended string correction and bounded Post correspondence problem.

Read more on Kudos…
The following have contributed to this page:
Wojciech Penczek and Artur Niewiadomski
' ,"url"));