| Name | Version | Summary | date |
| rustsat |
0.6.3 |
This library aims to provide implementations of elements commonly used in the development on software in the area of satisfiability solving. The focus of the library is to provide as much ease of use without giving up on performance. |
2024-12-20 14:42:39 |
| SparkleAI |
0.9.1.2 |
Sparkle is a Programming by Optimisation (PbO)-based problem-solving platform designed to enable the widespread and effective use of PbO techniques for improving the state-of-the-art in solving a broad range of prominent AI problems, including SAT and AI Planning. |
2024-12-12 07:26:09 |
| optilog |
0.6.1 |
None |
2024-09-13 10:32:03 |
| bauhaus |
1.2.0 |
Build logical theories for SAT solvers on the fly |
2024-09-11 01:00:50 |
| pycryptosat |
5.11.23 |
Bindings to CryptoMiniSat, an advanced SAT solver |
2024-07-14 14:23:58 |
| pyunigen |
2.5.8 |
Bindings to UniGen, an approximate sampler |
2024-02-08 21:30:21 |
| pyapproxmc |
4.1.24 |
Bindings to ApproxMC, an approximate model counter |
2024-02-08 21:20:01 |
| pycmsgen |
6.1.0 |
Bindings to CMSGen, uniform-like sampler |
2024-02-07 23:12:51 |
| pyeda |
0.29.0 |
Python Electronic Design Automation |
2023-11-19 17:38:55 |
| ctlog |
0.6.0 |
SAT-Based Combinatorial Testing in Python |
2023-07-09 11:14:40 |