satUZK

SATUZK: solver description. satUZK is a conflict-driven clause learning solver for the boolean satisfiability problem (SAT). It is written in C++ from scratch and aims to be flexible and easily extendable. In addition to the standard DPLL [1] algorithm with clause learning the solver is able to perform various preprocessing and inprocessing techniques.