Bindings for the 'PicoSAT' solver to solve Boolean satisfiability problems (SAT). The boolean satisfiability problem asks the question if a given boolean formula can be TRUE; i.e. does there exist an assignment of TRUE/FALSE for each variable such that the whole formula is TRUE? The package bundles 'PicoSAT' solver release 965 <http://www.fmv.jku.at/picosat/>.
https://anaconda.org/r/r-rpicosat/badges/version.svg
https://anaconda.org/r/r-rpicosat/badges/latest_release_date.svg
https://anaconda.org/r/r-rpicosat/badges/latest_release_relative_date.svg
https://anaconda.org/r/r-rpicosat/badges/platforms.svg
https://anaconda.org/r/r-rpicosat/badges/license.svg
https://anaconda.org/r/r-rpicosat/badges/downloads.svg