Optimal Base Encodings for Pseudo-Boolean Constraints

@inproceedings{Codish2011OptimalBE,
  title={Optimal Base Encodings for Pseudo-Boolean Constraints},
  author={Michael Codish and Yoav Fekete and Carsten Fuhs and Peter Schneider-Kamp},
  booktitle={TACAS},
  year={2011}
}
This paper formalizes the optimal base problem, presents an algorithm to solve it, and describes its application to the encoding of Pseudo-Boolean constraints to SAT. We demonstrate the impact of integrating our algorithm within the Pseudo-Boolean constraint solver MiniSat. Experimentation indicates that our algorithm scales to bases involving numbers up to 1,000,000, improving on the restriction in MiniSat to prime numbers up to 17. We show that, while for many examples primes up to 17 do… CONTINUE READING
Highly Cited
This paper has 17 citations. REVIEW CITATIONS
10 Citations
11 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Sum-of-digits function for certain nonstationary bases

  • N. Sidorov
  • Journal of Mathematical Sciences, 96(5):3609–3615…
  • 1999
1 Excerpt

MIPLIB: A test set of mixed integer programming problems

  • R. E. Bixby, E. A. Boyd, R. R. Indovina
  • SIAM News, 25:16,
  • 1992
1 Excerpt

Similar Papers

Loading similar papers…