Showing 2024Show all
2 papers · 1 filter
cs.LG2024
HardCore Generation: Generating Hard UNSAT Problems for Data Augmentation
Joseph Cotnareanu, Zhanguang Zhang, Hui-Ling Zhen +2
Efficiently determining the satisfiability of a boolean equation -- known as the SAT problem for brevity -- is crucial in various industrial problems. Recently, the advent of deep…
cs.LG2024
GraSS: Combining Graph Neural Networks with Expert Knowledge for SAT Solver Selection
Zhanguang Zhang, Didier Chetelat, Joseph Cotnareanu +7
Boolean satisfiability (SAT) problems are routinely solved by SAT solvers in real-life applications, yet solving time can vary drastically between solvers for the same instance. Th…