FourierSAT: A Fourier Expansion-Based Algebraic Framework for Solving
Hybrid Boolean Constraints

v1v2 (latest)

FourierSAT: A Fourier Expansion-Based Algebraic Framework for Solving Hybrid Boolean Constraints

2 December 2019

Anastasios Kyrillidis

Anshumali Shrivastava

ArXiv (abs)PDF HTML

Papers citing "FourierSAT: A Fourier Expansion-Based Algebraic Framework for Solving Hybrid Boolean Constraints"

9 / 9 papers shown

Title
Thinking Out of the Box: Hybrid SAT Solving by Unconstrained Continuous Optimization Zhiwei Zhang Samy Wu Fung Anastasios Kyrillidis Stanley Osher Moshe Y. Vardi 12 0 0 31 May 2025
Neural Approaches to SAT Solving: Design Choices and Interpretability David Mojžíšek Jan Hůla Ziwei Li Ziyu Zhou Mikoláš Janota AAML NAI 69 0 0 01 Apr 2025
Understanding GNNs for Boolean Satisfiability through Approximation Algorithms Jan Hůla David Mojžíšek Mikoláš Janota 82 5 0 27 Aug 2024
Massively Parallel Continuous Local Search for Hybrid SAT Solving on GPUs Yunuo Cen Zhiwei Zhang Xuanyao Fong 49 3 0 29 Aug 2023
Quantum-Inspired Approximations to Constraint Satisfaction Problems S. Lanham 48 0 0 08 Dec 2022
DPO: Dynamic-Programming Optimization on Hybrid Constraints Vu Hoang Nguyen Phan Moshe Y. Vardi TPM 20 2 0 17 May 2022
DPMS: An ADD-Based Symbolic Approach for Generalized MaxSAT Solving Anastasios Kyrillidis Moshe Y. Vardi Zhiwei Zhang 15 3 0 08 May 2022
Goal-Aware Neural SAT Solver Emīls Ozoliņš Kārlis Freivalds Andis Draguns Eliza Gaile Ronalds Zakovskis Sergejs Kozlovics NAI AAML 67 26 0 14 Jun 2021
On Continuous Local BDD-Based Search for Hybrid SAT Solving Anastasios Kyrillidis Moshe Y. Vardi Zhiwei Zhang 21 8 0 14 Dec 2020