Dear fellow gophers,
I'm happy to announce that gophersat, the SAT and pseudo-boolean solver
written in Go by the Centre de Recherche en Informatique de Lens, now
reached its first stable release (v1.0.0). It is available
at https://github.com/crillab/gophersat and is released under the MIT
license.
We chose to apply the "standard" go policy regarding versioning, meaning
the whole API will be backward-compatible for all coming 1.x versions, but
might break at versions 2.x and above. Minor versions will be used for new,
backward-compatible features, and patches for bug fixes or performance
improvements.
Gophersat is a reasonably efficient SAT solver, meaning it can solve
NP-complete problems described as propositional formulas, described either
in the standard DIMACS format or using a more user-friendly but proprietary
format. It also natively deals with pseudo-boolean (PB) problems, which
allow for a more compact representation of most problems. It can be used
for decision problems ("is there a solution to this problem ?") and
optimization problems ("what is the best possible solution, if any?"). It
can be used as a standalone executable or as a go library.
If you would like to contribute to gophersat, would like to use it but
don't know where to start, would like to understand how it works, or would
like a new feature to be added to it, please let me know.
Fabien
--
You received this message because you are subscribed to the Google Groups
"golang-nuts" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to golang-nuts+unsubscr...@googlegroups.com.
For more options, visit https://groups.google.com/d/optout.
