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/>.
|Author||Dirk Schumacher [aut, cre], Armin Biere [ctb, cph] (Author and copyright holder of included PicoSAT code)|
|Maintainer||Dirk Schumacher <firstname.lastname@example.org>|
|License||MIT + file LICENSE|
|Package repository||View on CRAN|
Install the latest version of this package by entering the following in R:
Any scripts or data that you put into this service are public.
Add the following code to your website.
For more information on customizing the embed code, read Embedding Snippets.