Satz (SAT solver)
Encyclopedia
SatZ is a well known SAT
Boolean satisfiability problem
In computer science, satisfiability is the problem of determining if the variables of a given Boolean formula can be assigned in such a way as to make the formula evaluate to TRUE...

 instance solver. It was developed by Prof. Chu Min Li, a computer science researcher. The Z stands for the last version of SAT solvers.
The source of this article is wikipedia, the free encyclopedia.  The text of this article is licensed under the GFDL.
 
x
OK