A Pearl on SAT Solving in Prolog (extended abstract)
Jacob M. Howe, Andy King · City Research Online (City University London) · 2011
The Boolean satisfiability problem, SAT, is of continuing interest because a variety of problems are naturally expressible as a SAT instance. Much effort has been expended in the development of algorithms for, and implementations of, efficient SAT solvers. This has borne fruit with a number of solvers that are either for specialised applications or are general purpose.