SatisfiabilityInterface.jlA Julia package for modelling discrete constraint satisfaction problems and encoding them to Boolean satisfiability (SAT) problems.
See this short video from JuliaCon 2021, which uses this Pluto notebook.
See also the examples directory for basic usage.
The resulting SAT problem is solved, by default, using the CryptoMiniSAT5 SAT solver, which is
automatically installed.
Copyright David P. Sanders 2021