The Quest for Efficient Boolean Satisfiability Solvers

  • Lintao Zhang
  • Sharad Malik
Conference paper

DOI: 10.1007/3-540-45657-0_2

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2404)
Cite this paper as:
Zhang L., Malik S. (2002) The Quest for Efficient Boolean Satisfiability Solvers. In: Brinksma E., Larsen K.G. (eds) Computer Aided Verification. CAV 2002. Lecture Notes in Computer Science, vol 2404. Springer, Berlin, Heidelberg

Abstract

The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical solutions to this problem enable significant practical applications. Since the first development of the basic search based algorithm proposed by Davis, Putnam, Logemann and Loveland (DPLL) about forty years ago, this area has seen active research effort with many interesting contributions that have culminated in state-of-the-art SAT solvers today being able to handle problem instances with thousands, and in same cases even millions, of variables. In this paper we examine some of the main ideas along this passage that have led to our current capabilities. Given the depth of the literature in this field, it is impossible to do this in any comprehensive way; rather we focus on techniques with consistent demonstrated efficiency in available solvers. For the most part, we focus on techniques within the basic DPLL search framework, but also briefly describe other approaches and look at some possible future research directions.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Lintao Zhang
    • 1
  • Sharad Malik
    • 1
  1. 1.Department of Electrical EngineeringPrinceton UniversityPrinceton

Personalised recommendations