-
**Is your feature request related to a problem? Please describe.**
We currently use only z3 to solve both path conditions and assertions. Some solvers like cvc5, bitwuzla or boolector, etc. may giv…
-
In my quest to benchmarks sat solvers in ocaml, I got all ocaml libs on opam that expose sat solver interfaces, and made a small ocaml program to compare them. The result is at https://github.com/Gbur…
Gbury updated
7 years ago
-
There are various domain-independent solvers available. Making the bridges to these commercial optimized solvers, competition winners or state-of-the-arts will widely enhance the ability to prototype …
-
Dear Pysat developer's team,
Thanks for creating such a useful toolkit. I want to solve a SAT problem encoded as a CNF. I am using the following commands to read the dimacs file containing the obta…
-
Right now, SULFA seems like kind of a standalone thing. It requires one of two particular SAT solvers, `minisat` or `zchaff`, neither of which has been actively developed in the last decade. Plus, the…
-
From @computablee's JOSS review thread (issue #50):
# Our investigation of why CVC4 doesn't work
First, a command that should work for launching CVC4 is
`cvc4 --lang smt2 --interactive --produce-…
-
The latest contest results are out, and we have a new top-solver: http://fmv.jku.at/kissat/
It's an improved version of CaDiCaL, and so hopefully not a big undertaking to include.
In a related n…
-
We could have a much more friendly user interface to SAT solvers by following what has been done for MixedIntegerLinearProgram. We propose that for a given SAT solver created via `solver = SAT()` we…
-
Markus suggested a couple SAT solvers:
- SATO ("full solver" - not sure what that means) https://homepage.divms.uiowa.edu/~hzhang/sato/
- WalkSAT ("local solver" - not sure what that means) https:…
-
Hello, I saw your post about your balancer book update and Factorio-SAT. Inspired by your post, I've started experimenting with running several SAT solvers in parallel to see which one wins based on t…