The effect of Nogood recording in DPLL-CBJ SAT algorithms

  • Authors:

  • Inês Lynce;João Marques-Silva

  • Affiliations:

  • Technical University of Lisbon, IST/INESC/CEL, Lisbon, Portugal;Technical University of Lisbon, IST/INESC/CEL, Lisbon, Portugal

  • Venue:
  • ERCIM'02/CologNet'02 Proceedings of the 2002 Joint ERCIM/CologNet international conference on Constraint solving and constraint logic programming
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Propositional Satisfiability (SAT) solvers have been the subject of remarkable improvements in the last few years. Currently, the most successful SAT solvers share a number of similarities, being based on backtrack search, applying unit propagation, and incorporating a number of additional search pruning techniques. Most, if not all, of the search reduction techniques used by state-of-the-art SAT solvers have been imported from the Constraint Satisfaction Problem (CSP) domain and, most significantly, include forms of back jumping and of no good recording. This paper proposes to investigate the actual usefulness of these CSP techniques in SAT solvers, with the objective of evaluating the actual role played by each individual technique.