DSAT extends Boolean SAT solving techniques such as unit resolution and clause learning to work natively on discrete variables with arbitrary values.
An Effective Learnt Clause Minimization Approach for CDCL SAT Solvers *
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.AI 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.