CQU
Decision solver for Counting Quantifiers over Unary Predicates
...It also emplouys COIN-OR Clp linear programming solver, and inherit from it.
Given a CQUSAT instance in normal form as input, the program returns a solution, if there is one. The implemented method employs dual Simplex Algorithm with Column Generation.
At each iteration, a SAT instance is generated and a SAT Solver (minisat) decides its satisfiability. Details about CQUSAT, its normal form and this turing reduction can be found in the paper
"CQUSAT.pdf" that comes with this package.
...