DSAT extends Boolean SAT solving techniques such as unit resolution and clause learning to work natively on discrete variables with arbitrary values.
On the glucose sat solver
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Foundational MIP embeddings transfer directly to SAT for unsupervised clustering and distribution identification without architectural changes or supervised training.
citing papers explorer
-
Dsat: A Native SAT Solver for Discrete Logic
DSAT extends Boolean SAT solving techniques such as unit resolution and clause learning to work natively on discrete variables with arbitrary values.
-
Transfer Learning from Foundational Optimization Embeddings to Unsupervised SAT Representations
Foundational MIP embeddings transfer directly to SAT for unsupervised clustering and distribution identification without architectural changes or supervised training.