----------------
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.

Features

  • Solving Constraints in the formar of Counting Quantifiers over Unary predicates

Project Activity

See All Activity >

Follow CQU

CQU Web Site

Other Useful Business Software
Our Free Plans just got better! | Auth0 Icon
Our Free Plans just got better! | Auth0

With up to 25k MAUs and unlimited Okta connections, our Free Plan lets you focus on what you do best—building great apps.

You asked, we delivered! Auth0 is excited to expand our Free and Paid plans to include more options so you can focus on building, deploying, and scaling applications without having to worry about your security. Auth0 now, thank yourself later.
Try free now
Rate This Project
Login To Rate This Project

User Reviews

Be the first to post a review of CQU!

Additional Project Details

Registered

2016-11-27