GaloisSAT: Differentiable Boolean Satisfiability Solving via Finite Field Algebra
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866911555636953088 |
|---|---|
| author | Kim, Curie Portner, Carsten Liu, Mingju Dai, Steve Ren, Haoxing Khailany, Brucek Velasquez, Alvaro Alkhouri, Ismail Yu, Cunxi |
| author_facet | Kim, Curie Portner, Carsten Liu, Mingju Dai, Steve Ren, Haoxing Khailany, Brucek Velasquez, Alvaro Alkhouri, Ismail Yu, Cunxi |
| contents | Boolean satisfiability (SAT) problem, the first problem proven to be NP-complete, has become a fundamental challenge in computational complexity, with widespread applications in optimization and verification across many domains. Despite significant algorithmic advances over the past two decades, the performance of SAT solvers has improved at a limited pace. Notably, the 2025 competition winner shows only about a 2X improvement over the 2006 winner in SAT Competition performance after nearly 20 years of effort. This paper introduces GaloisSAT, a novel hybrid GPU-CPU SAT solver that integrates a differentiable SAT solving engine powered by modern machine learning infrastructure on GPUs, followed by a traditional CDCL-based SAT solving stage on CPUs. GaloisSAT is benchmarked against the latest versions of state-of-the-art solvers, Kissat and CaDiCaL, using the SAT Competition 2024 benchmark suite. Results demonstrate substantial improvements in the official SAT Competition metric PAR-2 (penalized average runtime with a timeout of 5,000 seconds and a penalty factor of 2). Specifically, GaloisSAT achieves an 8.41X speedup in the satisfiable category and a 1.29X speedup in the unsatisfiable category compared to the strongest baselines. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_28796 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | GaloisSAT: Differentiable Boolean Satisfiability Solving via Finite Field Algebra Kim, Curie Portner, Carsten Liu, Mingju Dai, Steve Ren, Haoxing Khailany, Brucek Velasquez, Alvaro Alkhouri, Ismail Yu, Cunxi Logic in Computer Science Artificial Intelligence Boolean satisfiability (SAT) problem, the first problem proven to be NP-complete, has become a fundamental challenge in computational complexity, with widespread applications in optimization and verification across many domains. Despite significant algorithmic advances over the past two decades, the performance of SAT solvers has improved at a limited pace. Notably, the 2025 competition winner shows only about a 2X improvement over the 2006 winner in SAT Competition performance after nearly 20 years of effort. This paper introduces GaloisSAT, a novel hybrid GPU-CPU SAT solver that integrates a differentiable SAT solving engine powered by modern machine learning infrastructure on GPUs, followed by a traditional CDCL-based SAT solving stage on CPUs. GaloisSAT is benchmarked against the latest versions of state-of-the-art solvers, Kissat and CaDiCaL, using the SAT Competition 2024 benchmark suite. Results demonstrate substantial improvements in the official SAT Competition metric PAR-2 (penalized average runtime with a timeout of 5,000 seconds and a penalty factor of 2). Specifically, GaloisSAT achieves an 8.41X speedup in the satisfiable category and a 1.29X speedup in the unsatisfiable category compared to the strongest baselines. |
| title | GaloisSAT: Differentiable Boolean Satisfiability Solving via Finite Field Algebra |
| topic | Logic in Computer Science Artificial Intelligence |
| url | https://arxiv.org/abs/2603.28796 |