Many tasks in combinatorial computation admit a natural formulation as instances of the exact cover problem. We observe that the exact cover problem can in turn be compactly translated to the satisfiability (SAT) problem, allowing the basic Davis-Putnam-Logemann-Loveland procedure with no clause learning to linearly simulate backtrack search for exact cover. This SAT-based approach is empirically compared with a widely applied backtrack search algorithm, Knuth's "Dancing Links X" algorithm, on a set of benchmark problems arising in combinatorial enumeration. The experimental results indicate that the current model-counting SAT solvers are in general superior in pruning the search space, but still need to be optimized for running time. © 2010 Springer-Verlag.
CITATION STYLE
Junttila, T., & Kaski, P. (2010). Exact cover via satisfiability: An empirical study. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6308 LNCS, pp. 297–304). Springer Verlag. https://doi.org/10.1007/978-3-642-15396-9_25
Mendeley helps you to discover research relevant for your work.