Efficient conflict driven learning in a boolean satisfiability solver

  • Authors:

  • Lintao Zhang;Conor F. Madigan;Matthew H. Moskewicz;Sharad Malik

  • Affiliations:

  • Princeton University;MIT;UC Berkeley;Princeton University

  • Venue:
  • Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
  • Year:
  • 2001

Quantified Score

Hi-index 0.01

Visualization

Abstract

One of the most important features of current state-of-the-art SAT solvers is the use of conflict based backtracking and learning techniques. In this paper, we generalize various conflict driven learning strategies in terms of different partitioning schemes of the implication graph. We re-examine the learning techniques used in various SAT solvers and propose an array of new learning schemes. Extensive experiments with real world examples show that the best performing new learning scheme has at least a 2X speedup compared with learning schemes employed in state-of-the-art SAT solvers.