msoos

Solve Boolean satisfiability (SAT) problems with the pycryptosat Python library. Use when a problem can be expressed as Boolean variables and logical constraints — e.g. "is this set of rules consistent?", "find an assignment satisfying these conditions", "are these requirements contradictory?". CMS is a pure SAT solver: it answers SAT/UNSAT over CNF (AND-of-ORs) clauses, with native support for XOR (parity) constraints. Do NOT use it directly for integer/real arithmetic or optimization — see "When NOT to use this" below.