SIGmA: GPU Accelerated Simplification of SAT Formulas

We present SIGmA (SAT sImplification on GPU Architectures), a preprocessor to accelerate SAT solving that runs on NVIDIA GPUs. We discuss the tool, focussing on its full functionality and how it can be used in combination with state-of-the-art SAT solvers. SIGmA performs various types of simplification, such as variable elimination, subsumption elimination, blocked clause elimination and hidden redundancy elimination. We study the effectiveness of our tool when applied prior to SAT solving. Overall, for our large benchmark set of problems, SIGmA enables MiniSat and Lingeling to solve many problems in less time compared to applying the SatElite preprocessor.

[1]  Norbert Manthey,et al.  Parallel Variable Elimination on CNF Formulas , 2013, KI.

[2]  Fabio Somenzi,et al.  An Incremental Algorithm to Check Satisfiability for Bounded Model Checking , 2005, Electron. Notes Theor. Comput. Sci..

[3]  Dhiraj K. Pradhan,et al.  NiVER: Non Increasing Variable Elimination Resolution for Preprocessing SAT instances , 2004, SAT.

[4]  Armin Biere,et al.  Effective Preprocessing in SAT Through Variable and Clause Elimination , 2005, SAT.

[5]  Aziza I. Hussein,et al.  An Efficient SAT-Based Test Generation Algorithm with GPU Accelerator , 2018, J. Electron. Test..

[6]  Cees T. A. M. de Laat,et al.  A Medium-Scale Distributed System for Computer Science Research: Infrastructure for the Long Term , 2016, Computer.

[7]  Oliver Kullmann,et al.  On a Generalization of Extended Resolution , 1999, Discret. Appl. Math..

[8]  Dragan Bosnacki,et al.  GPUexplore 2.0: Unleashing GPU Explicit-State Model Checking , 2016, FM.

[9]  Anton Wijs,et al.  Parallel SAT Simplification on GPU Architectures , 2019, TACAS.

[10]  Dragan Bosnacki,et al.  GPU-PRISM: An Extension of PRISM for General Purpose Graphics Processing Units , 2010, 2010 Ninth International Workshop on Parallel and Distributed Methods in Verification, and Second International Workshop on High Performance Computational Systems Biology.

[11]  Niklas Sörensson,et al.  An Extensible SAT-solver , 2003, SAT.

[12]  Dragan Bosnacki,et al.  Many-core on-the-fly model checking of safety properties using GPUs , 2016, International Journal on Software Tools for Technology Transfer.

[13]  Anton Wijs,et al.  BFS-Based Model Checking of Linear-Time Properties with an Application on GPUs , 2016, CAV.

[14]  Mohammed Moness,et al.  An Efficient Implementation of Ant Colony Optimization on GPU for the Satisfiability Problem , 2015, 2015 23rd Euromicro International Conference on Parallel, Distributed, and Network-Based Processing.

[15]  Armin Biere.  Lingeling, Plingeling and Treengeling Entering the SAT Competition 2013 , 2013 .

[16]  Anton Wijs.  GPU Accelerated Strong and Branching Bisimilarity Checking , 2015, TACAS.