pindakaas 0.4.1

Boolean satisfiability (SAT) library with efficient encoding of complex constraints and solver interaction

A library to transform pseudo-Boolean and integer constraints into conjunctive normal form.

Supported Constraints

• At most one (AMO)
  • Bitwise encoding
  • Ladder encoding
  • Pairwise encoding
• Cardinality constraints
  • Sorting Network encoding
• Boolean linear
  • Adder encoding
  • BDD encoding
  • Sequential Weight Counter encoding
  • Totalizer encoding
• Integer (linear)
  • Direct / Domain / Unary encoding
  • Order encoding
  • Binary encoding

Installation and usage

Although the main Pindakaas library is written in rust, it is also available from Python.

Rust

cargo add pindakaas

For more information about the Rust library, please visit the official documentation.

Python

pip install pindakaas

For more information about the Python library, please visit the official documentation.

Citation

If you want to cite Pindakaas please use our general software citation, in addition to any citation to a specific version or paper:

@software{Pindakaas,
author = {Bierlee, Hendrik and Dekker, Jip J.},
license = {MPL-2.0},
title = {{Pindakaas}},
url = {https://doi.org/10.5281/zenodo.10851855},
doi = {10.5281/zenodo.10851855},
}

Note that you might have to use misc instead of software, if your system does not support software as a type.

Acknowledgements

This research was partially funded by the Australian Government through the Australian Research Council Industrial Transformation Training Centre in Optimisation Technologies, Integrated Methodologies, and Applications (OPTIMA), Project ID IC200100009

License

This library is made available under the MPL-2.0 license.