Corpus ID: 8660838

Generalizations of Watched Literals for Backtracking Search

  title={Generalizations of Watched Literals for Backtracking Search},
  author={A. V. Gelder},
  journal={Annals of Mathematics and Artificial Intelligence},
  • A. V. Gelder
  • Published 2002
  • Computer Science, Mathematics
  • Annals of Mathematics and Artificial Intelligence
The technique of watching two literals per clause to determine when a clause becomes a unit clause was introduced recently in the Chaff satisfiability program. That program does not perform either equivalent-literal detection or binary-clause detection. We describe a generalization of the technique that handles the tracking necessary to support equivalent-literal detection and binary-clause detection. Both generalizations are designed to preserve the important property of the original method… Expand
Optimal Implementation of Watched Literals and More General Techniques
Efficient SAT solving: beyond supercubes
Satisfiability Advancements Enabled by State Machines
Max-SAT formalisms with hard and soft constraints
PicoSAT Essentials
  • Armin Biere
  • Computer Science
  • J. Satisf. Boolean Model. Comput.
  • 2008
Early Conflict Detection Based BCP for SAT Solving
Algorithms for the Satisfiability Problem
Producing and verifying extremely large propositional refutations
  • A. V. Gelder
  • Computer Science
  • Annals of Mathematics and Artificial Intelligence
  • 2012


Satisfiability testing with more reasoning and less guessing
Efficient conflict driven learning in a Boolean satisfiability solver
Extracting (Easily) Checkable Proofs from a Satisfiability Solver that Employs both Preorder and Postorder Resolution
Integrating Equivalency Reasoning into Davis-Putnam Procedure
SATO: An Efficient Propositional Prover
GRASP-A new search algorithm for satisfiability
A Hierarchy of Tractable Satisfiability Problems
Chaff: engineering an efficient SAT solver
An efficient algorithm for the 3-satisfiability problem