A novel conflict directed jumping algorithm for hardware-based SAT solvers

Much of the performance improvement achieved by state-of-the-art SAT solvers is related to the implementation of conflict analysis which enables the solver to perform nonchronological conflict-based backjumping and learn new clauses. However, these techniques have been ignored by the majority of hardware SAT solvers or are executed on some coupled software running on an attached host processor. In this paper, we present a reconfigurable hardware SAT solver that performs a search algorithm combining the advanced techniques: non-chronological backjumping, dynamic backtracking and learning. The whole execution is done in hardware eliminating any runtime communication with the host processor. The feasibility of the proposed approach is experimented through instances from the DIMACS benchmarks suite.