- Name: minisat2
- Version: 2.0
- Release: 9.20070721.fc12
- Epoch:
- Group: Applications/Engineering
- License: MIT
- Url: http://minisat.se/
- Summary: A minimalistic, open-source SAT solver
- Architecture: ppc
- Size: 62864
- Distribution: Koji
- Vendor: Fedora Project
- Packager: Fedora Project
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.
- BuildArch:
- ExcludeArch:
- ExclusiveArch:
- Cookie: ppc4.fedora.phx.redhat.com 1248660184
- Buildhost: ppc4.fedora.phx.redhat.com
Generated packages:
Other version of this rpm: