2 citations · 3 across the 2 of their papers we have counts for
2 papers
cs.AI2020★ 2 cited
On Continuous Local BDD-Based Search for Hybrid SAT Solving
Anastasios Kyrillidis, Moshe Y. Vardi, Zhiwei Zhang
We explore the potential of continuous local search (CLS) in SAT solving by proposing a novel approach for finding a solution of a hybrid system of Boolean constraints. The algorit…
cs.LO2019★ 1 cited
FourierSAT: A Fourier Expansion-Based Algebraic Framework for Solving Hybrid Boolean Constraints
Anastasios Kyrillidis, Anshumali Shrivastava, Moshe Y. Vardi +1
The Boolean SATisfiability problem (SAT) is of central importance in computer science. Although SAT is known to be NP-complete, progress on the engineering side, especially that of…