Description
Boolean satisfiability problems can be solved with a compact high-performance SAT solver.
It is useful for researchers, verification tools, planning systems, and software that reduces logic problems to SAT. Solver results depend on correct input encoding, so validate models before using results for decisions.