Symbolic Techniques in Propositional Satisfiability Solving

  • Authors:

  • Moshe Y. Vardi

  • Affiliations:

  • Department of Computer Science, Rice University, Houston, U.S.A. 77251-1892

  • Venue:
  • SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Search-based techniques in propositional satisfiability (SAT) solving have been enormously successful, leading to what is becoming known as the "SAT Revolution". Essentially all state-of-the-art SAT solvers are based on the Davis-Putnam-Logemann-Loveland (DPLL) technique, augmented with backjumping and conflict learning. Much of current research in this area involves refinements and extensions of the DPLL technique. Yet, due to the impressive success of DPLL, little effort has gone into investigating alternative techniques. This work focuses on symbolic techniques for SAT solving, with the aim of stimulating a broader research agenda in this area.