A thin generic SAT (propositional satisfiability problem) solver interface to your favorite “industrial-strength” SAT solver. Whichever code wins the next SATRace competition, it is easily glued on as a new backend, no need to change your CL code.
For a start it include PrecoSat, from PrecoSAT (jku.at) and Minisat v2, from minisat.se, but more backends can easily be added.
Repository: at repo.or.cz
See Also: cl-cudd