A penalty-based unconstrained continuous formulation of hybrid SAT preserves the satisfiability reduction, and penalty terms can be omitted exactly for constraints like OR, XOR, and NAE, which are called rounding-friendly.
Pblib – a library for encoding pseudo-boolean constraints into cnf
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.LO 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Thinking Out of the Box: Hybrid SAT Solving by Unconstrained Continuous Optimization
A penalty-based unconstrained continuous formulation of hybrid SAT preserves the satisfiability reduction, and penalty terms can be omitted exactly for constraints like OR, XOR, and NAE, which are called rounding-friendly.