DSAT extends Boolean SAT solving techniques such as unit resolution and clause learning to work natively on discrete variables with arbitrary values.
Marques Silva and K.A
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.AI 2representative citing papers
A branch-and-bound algorithm with custom node selection, branching rules, and conflict definitions solves the logic-constrained shortest path problem for flight planning with traffic flow restrictions, showing order-of-magnitude speedups on a public global dataset with 20000 real constraints.
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.
-
Logic-Constrained Shortest Paths for Flight Planning
A branch-and-bound algorithm with custom node selection, branching rules, and conflict definitions solves the logic-constrained shortest path problem for flight planning with traffic flow restrictions, showing order-of-magnitude speedups on a public global dataset with 20000 real constraints.