cadical
CaDiCaL SAT Solver (by arminbiere)
ipasir
The Standard Interface for Incremental Satisfiability Solving (by biotomas)
Our great sponsors
| cadical | ipasir | |
|---|---|---|
| 3 | 1 | |
| 310 | 47 | |
| - | - | |
| 9.5 | 0.0 | |
| 1 day ago | almost 2 years ago | |
| C++ | C++ | |
| MIT License | GNU General Public License v3.0 or later |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
cadical
Posts with mentions or reviews of cadical.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2023-05-26.
-
The Silent (R)evolution of SAT
That is true, but there are many interesting heuristics in modern SAT solvers, such as kissat: https://github.com/arminbiere/kissat (winner for a few years now). LBD ("glues" in glucose) is one of them. Kissat is actually quite readable. More readable is CaDiCaL, also extremely fast and effective: https://github.com/arminbiere/cadical
I personally also develop a SAT solver called CryptoMiniSat, but the above two are easier to read :)
-
How would you suggest building an application to solve a puzzle?
You'd probably end up with thousands of variables and tens / hundreds of thousands of constraints. You'd assign each variable a number, then feed the whole mess of constraint equations into an off-the-shelf SAT solver like Cadical, then interpret the solver's results in terms of puzzle piece positions.
-
kotlin-satlib: SAT solver wrappers for Kotlin
Alongside with the SAT solver interface and its extensions, `kotlin-satlib` provides wrappers for native SAT solvers (these days, most of them are written in C/C++) implemented using JNI technology. Currently, the solvers included are: MiniSat, Glucose, Cadical and CryptoMiniSat. Sadly, `kotlin-satlib` won't work out-of-the-box, you have to provide it with some external SAT solver, either in the form of a library or a binary. Luckily, there are build instructions for each of the supported SAT solver, both for Linux and Windows. Checkout the README!
ipasir
Posts with mentions or reviews of ipasir.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2021-07-13.
-
kotlin-satlib: SAT solver wrappers for Kotlin
The generic interface of the SAT solver is not based on the standard IPASIR one, but is more pragmatic and user-friendly. It consists of the most commonly used operations performed with the SAT solver:
What are some alternatives?
When comparing cadical and ipasir you can also consider the following projects:
cryptominisat - An advanced SAT solver
kotlin-satlib - 🗿 SAT solver wrappers for Kotlin
jnisat - Java JNI bindings for the PicoSat and MiniSat SAT solvers
CDCL.jl - Conflict Driven Clause Learning in Julia
Sourcetrail - Sourcetrail - free and open-source interactive source explorer
kissat
GuiLite - ✔️The smallest header-only GUI library(4 KLOC) for all platforms