Metraipolis › archive › dc_4e70930f4a30

Accelerating Floating-Point Satisfiability Solving via Gradient Normalization — arXiv:2610.08808

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.08808
License (as archived)
CC0-1.0
Archived
2026-10-08T11:06:37.353Z
SHA-256 of the archived text
fcc85df841568ef1e85b991a6affa96bddfcc3ed9b95bde45ccf7a545f00530a
Stable URL of this page
https://metraipolis.com/documento/dc_4e70930f4a30

How to cite

Accelerating Floating-Point Satisfiability Solving via Gradient Normalization — arXiv:2610.08808 — arXiv (en), https://arxiv.org/abs/2610.08808 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4e70930f4a30 (Metraipolis archive dc_4e70930f4a30, sha256 fcc85df841568ef1e85b991a6affa96bddfcc3ed9b95bde45ccf7a545f00530a)
BibTeX
@misc{dc4e70930f4a30,
  title = {Accelerating Floating-Point Satisfiability Solving via Gradient Normalization — arXiv:2610.08808},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.08808},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4e70930f4a30; sha256 fcc85df841568ef1e85b991a6affa96bddfcc3ed9b95bde45ccf7a545f00530a},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.08808. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 successfully applied gradient descent to continuous relaxations of logical formulas, they are fundamentally bottlenecked by gradient domination, a phenomenon where a small subset of difficult clauses hijacks the optimization trajectory, preventing the solver from satisfying the broader formula and trapping it in local minima. To overcome this, we present GradSAT, a novel framework that bridges optimization-based SMT solving with Multi-Task Learning (MTL). GradSAT reformulates the constraint satisfaction process by treating each SMT clause as an independent MTL task. By applying dynamic gradient normalization (GradNorm), GradSAT actively balances the gradient magnitudes across all clauses at runtime, systematically penalizing dominant gradients and accelerating lagging clauses to ensure uniform convergence. GradSAT implements this through a highly optimized, two-stage hybrid pipeline. First, a GPU-accelerated PyTorch backend leveraging symbolic compilation and operator fusion navigates the continuous relaxation to a high-quality basin. Second, the candidate assignment is handed off to a bit-precise local search engine to rapidly resolve the exact, rigorous assignment. By stabilizing the continuous search dynamics, GradSAT mitigates the brittleness of prior gradient-based solvers and provides a robust, highly parallelizable architecture for complex constraint solving.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno).
Categorie arXiv: Artificial Intelligence (cs.AI) ; Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2610.08808 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-08T10:14:05.870Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).