| Name : minisat2
| |
| Version : 2.0
| Vendor : Fedora Project
|
| Release : 9.20070721.fc12
| Date : 2009-07-27 04:02:47
|
| Group : Applications/Engineering
| Source RPM : minisat2-2.0-9.20070721.fc12.src.rpm
|
| Size : 0.08 MB
| |
| Packager : Fedora Project
| |
| Summary : A minimalistic, open-source SAT solver
|
Description :
MiniSat is a minimalistic, open-source Boolean satisfiability problem
(SAT) solver, developed for researchers and developers alike.
Winning all the industrial categories of the SAT 2005 competition,
MiniSat is a good starting point both for future research in SAT, and
for applications using SAT.
A SAT solver can determine if it is possible to find assignments to boolean
variables that would make a given expression true, if the expression is
written with only AND, OR, NOT, parentheses, and boolean variables.
If the expression is satisfiable, MiniSAT can also produce a
set of assignments that make the expression true.
Although the problem is NP-complete, SAT solvers (like this one)
are often able to decide this problem in a reasonable time frame.
|
RPM found in directory: /packages/linux-pbone/archive.fedoraproject.org/fedora/linux/releases/13/Everything/i386/os/Packages |
