[Date Prev][Date Next] [Thread Prev][Thread Next] [Thread Index] [Date Index] [Author Index]

*From*: updates fedoraproject org*To*: fedora-package-announce redhat com*Subject*: Fedora 9 Update: minisat2-2.0-7.20070721.fc9*Date*: Wed, 10 Sep 2008 07:08:04 +0000

-------------------------------------------------------------------------------- Fedora Update Notification FEDORA-2008-7254 2008-09-05 10:28:23 -------------------------------------------------------------------------------- Name : minisat2 Product : Fedora 9 Version : 2.0 Release : 7.20070721.fc9 URL : http://minisat.se/ 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. -------------------------------------------------------------------------------- Update Information: Initial release of minisat2. 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. -------------------------------------------------------------------------------- References: [ 1 ] Bug #453701 - Review Request: minisat2 - A minimalistic, open-source SAT solver https://bugzilla.redhat.com/show_bug.cgi?id=453701 -------------------------------------------------------------------------------- This update can be installed with the "yum" update program. Use su -c 'yum update minisat2' at the command line. For more information, refer to "Managing Software with yum", available at http://docs.fedoraproject.org/yum/. All packages are signed with the Fedora Project GPG key. More details on the GPG keys used by the Fedora Project can be found at http://fedoraproject.org/keys --------------------------------------------------------------------------------

[Date Prev][Date Next] [Thread Prev][Thread Next] [Thread Index] [Date Index] [Author Index]