Divide and Conquer: Towards Faster Pseudo-Boolean Solving

@inproceedings{Elffers2018DivideAC,
  title={Divide and Conquer: Towards Faster Pseudo-Boolean Solving},
  author={Jan Elffers and Jakob Nordstr{\"o}m},
  booktitle={IJCAI},
  year={2018}
}
The last 20 years have seen dramatic improvements in the performance of algorithms for Boolean satisfiability—so-called SAT solvers—and today conflict-driven clause learning (CDCL) solvers are routinely used in a wide range of application areas. One serious short-coming of CDCL, however, is that the underlying method of reasoning is quite weak. A tantalizing solution is to instead use stronger pseudo-Boolean (PB) reasoning, but so far the promise of exponential gains in performance has failed… CONTINUE READING

References

Publications referenced by this paper.
SHOWING 1-10 OF 27 REFERENCES