Brief

Researchers have developed Accelerated Fourier SAT (AFSAT), a new GPU-accelerated solver for pseudo-Boolean satisfiability problems. AFSAT builds upon a previous proof-of-concept, FastFourierSAT, by engineering a fully functional solver that can handle mixed constraint types and lengths within a single instance. Utilizing the JAX compiler for parallel processing and automatic differentiation, AFSAT demonstrates enhanced numerical stability, runtime performance, and memory efficiency, partially by employing a custom discrete Fourier transform implementation to address floating-point limitations. AI

Researchers have explored parallel Continuous Local Search (CLS) as a method for solving Boolean satisfiability problems with symmetric pseudo-Boolean constraints. The study found that redundant constraints can hinder convergence, and CLS shows potential as a component in hybrid solvers for completing partial assignments. Additionally, local search quickly reaches a stable solution quality distribution due to objective functions where further steps offer diminishing returns. AI