Dagster - Parallel Structured Search for Boolean Satisfiability (SAT) problems
-
Updated
Sep 26, 2025 - HTML
#
sharp-sat
Here are 2 public repositories matching this topic...
SATX is a declarative framework for modeling, analysis, and synthesis using exact SAT and model counting (#SAT) under a unified semantic discipline. SATX treats satisfiability and model counting as coordinated operators, enabling existence checking, constructive synthesis, and structural analysis of solution spaces and theories.
formal-methods formal-verification knowledge-representation satisfiability model-counting symbolic-reasoning sharp-sat underdetermination theory-identification
-
Updated
Jan 4, 2026 - Python
Improve this page
Add a description, image, and links to the sharp-sat topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the sharp-sat topic, visit your repo's landing page and select "manage topics."