Mail Archive Home | sat4j-dev List | August 2007 Index
| <-- Date Index | <-- Thread Index |
Dear all,
I just released version 1.7 of SAT4J.
Among the new features:
* New SAT solver presented to the SAT Race 2006 including the
expensive reason simplification developed in MiniSAT 1.14
(MiniLearningHeapExpSimp)
* New command line configuration of solvers
* Optional more robust (but less efficient) CNF input (allows to
include comments between constraints): jar -jar sat4j.jar
EZCNF:/my/dimacs/file.cnf
* Basic support for And Inverter Graph format
<http://fmv.jku.at/aiger/>, in both ASCII (aag) and binary (aig)
form.
* Improved and simplified Pseudo Boolean code.
* Fine code tuning provided by Dieter von Holten: 10% speedup in
average.
* Memory management: constraints are removed only when memory is
exhausted.
* Bug fixing in the optimization framework.
* Improved code for the CSP to SAT conversion.
* Improved Javadoc.
* Rapid Restart Strategy, as in RSAT and picosat.
<http://www.satcompetition.org/gorydetails/?p=3>
* Improved solvers for pseudo boolean constraints
* Use now Java generics to prevent user to setup a solver with
incompatible components (i.e. a heuristics that needs information
available only from a specific representation of binary clauses
with a usual clause representation for instance).Have fun!
Daniel
--
Daniel Le Berre mailto:leberre@xxxxxxxxxxxxxxxxxxx
MCF, CRIL-CNRS FRE 2499, Universite d'Artois
http://www.cril.univ-artois.fr/~leberre| <-- Date Index | <-- Thread Index |
Powered by MHonArc.
Copyright © 2006-2007, OW2 Consortium | contact | webmaster.