Toward leaner binary-clause reasoning in a satisfiability solver

@article{Gelder2005TowardLB,
  title={Toward leaner binary-clause reasoning in a satisfiability solver},
  author={Allen Van Gelder},
  journal={Annals of Mathematics and Artificial Intelligence},
  year={2005},
  volume={43},
  pages={239-253}
}
Binary-clause reasoning has been shown to reduce the size of the search space on many satisfiability problems, but has often been so expensive that run-time was higher than that of a simpler procedure that explored a larger space. The method of Sharir for detecting strongly connected components in a directed graph can be adapted to performing “ lean” resolution on a set of binary clauses. Beyond simply detecting unsatisfiability, the goal is to find implied equivalent literals, implied unit… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 20 CITATIONS

References

Publications referenced by this paper.