PulseAugur
EN
LIVE 08:07:25

New GPU solver AFSAT enhances pseudo-Boolean satisfiability

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

IMPACT Introduces a novel approach to SAT solving that could accelerate AI research and development requiring constraint satisfaction.

RANK_REASON The cluster contains a research paper detailing a new algorithm and solver. [lever_c_demoted from research: ic=1 ai=1.0]

Read on arXiv cs.AI →

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →

COVERAGE [1]

  1. arXiv cs.AI TIER_1 English(EN) · Cody J Christopher, Charles Gretton ·

    Accelerated Fourier SAT (AFSAT): Fully Realising a GPU-based Symmetric Pseudo-Boolean SAT Solver

    arXiv:2606.06641v1 Announce Type: new Abstract: We present Accelerated Fourier SAT (AFSAT), a GPU-accelerated solver for pseudo-Boolean satisfiability based on continuous local search (CLS). AFSAT realises the proof-of-concept approach, FastFourierSAT, into a fully-engineered sol…