Dagster - Parallel Structured Search for Boolean Satisfiability (SAT) problems
-
Updated
Aug 14, 2026 - HTML
Dagster - Parallel Structured Search for Boolean Satisfiability (SAT) problems
Librería autocontenida de C++26 para aritmética de números complejos CBE (Complejo Binario Entrelazado) resolubles por SAT.
SAT instance generator built for benchmarking model counters
SAT instance generator built for benchmarking model counters
Turn 'we found no escapes' into an exact integer. Exact and soundly-bracketed model counting for guard over-acceptance.
Add a description, image, and links to the sharp-sat topic page so that developers can more easily learn about it.
To associate your repository with the sharp-sat topic, visit your repo's landing page and select "manage topics."