The Boolean constraint solver of SWI-Prolog (system description)
From MaRDI portal
Recommendations
Cites work
- A simple and efficient Boolean solver for constraint logic programming
- Graph-Based Algorithms for Boolean Function Manipulation
- scientific article; zbMATH DE number 2080337 (Why is no real title available?)
- scientific article; zbMATH DE number 1406235 (Why is no real title available?)
- scientific article; zbMATH DE number 956863 (Why is no real title available?)
- On the implementation of GNU Prolog
- Preprocessing Boolean formulae for BDDs in a probabilistic context
- Projection, consistency, and George Boole
- The art of computer programming. Vol. 4, Fasc. 0--4. Fasc. 0: Introduction to combinatorial algorithms and Boolean functions. Fasc. 1: Bitwise tricks \& techniques, binary decision diagrams. Fasc. 2: Generating all tuples and permutations. Fasc. 3: Genera
Cited in
(3)
This page was built for publication: The Boolean constraint solver of SWI-Prolog (system description)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2798256)