CQU

----------------
cqusat 1.0
----------------

cqusat is a conbstraint solver decides the satisfiability of a set of sentences containing Counting Quantifiers over Unary predicates. It also accepts Universally quantifies sentences over unary predicates, which are presented in the form of propositional clauses (classical Boolean logic
clauses). This implementation employs minisat as the SAT solver. 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.

For more information, see the README file.