DSAT extends Boolean SAT solving techniques such as unit resolution and clause learning to work natively on discrete variables with arbitrary values.
Kautz and Bart Selman
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
verdicts
UNVERDICTED 2representative citing papers
New ERCL algorithm using dual implication points in CDCL SAT solvers shows performance gains over baselines on Tseitin and XORified formulas.
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.
-
Extended Resolution Clause Learning via Dual Implication Points
New ERCL algorithm using dual implication points in CDCL SAT solvers shows performance gains over baselines on Tseitin and XORified formulas.