Accelerating Floating-Point Satisfiability Solving via Gradient Normalization
arXiv:2610.08808v1 Announce Type: new Abstract: Satisfiability Modulo Theories (SMT) solvers are foundational to software verification, program analysis, and compiler testing, particularly over the theory of Quantifier-Free Floating-Point (QF_FP). While recent optimization-based SMT solvers have su…
Read the full story at arXiv cs.AI ↗
Timeline · 1 report
- 2026-10-08 04:00 · arXiv cs.AI
Accelerating Floating-Point Satisfiability Solving via Gradient Normalization