A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Parallel SAT Simplification on GPU Architectures
[chapter]
2019
Lecture Notes in Computer Science
The growing scale of applications encoded to Boolean Satisfiability (SAT) problems imposes the need for accelerating SAT simplifications or preprocessing. Parallel SAT preprocessing has been an open challenge for many years. Therefore, we propose novel parallel algorithms for variable and subsumption elimination targeting Graphics Processing Units (GPUs). Benchmarks show that the algorithms achieve an acceleration of 66× over a state-of-the-art SAT simplifier (SatELite). Regarding SAT solving,
doi:10.1007/978-3-030-17462-0_2
fatcat:yqosvargirhgrgivahhfkj5pay