Optimal Base Encodings for Pseudo-Boolean Constraints

Details Optimal Base Encodings for Pseudo-Boolean Constraints Optimal Base Encodings for Pseudo-Boolean Constraints

2010-07-28

arxiv.org/abs/1007.4935v3

Computer Science

Discrete Mathematics

Scientific paper

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 suffice, encoding with respect to optimal bases reduces the CNF sizes and improves the subsequent SAT solving time for many examples.

Affiliated with

Also associated with

No associations

Rating

Optimal Base Encodings for Pseudo-Boolean Constraints does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimal Base Encodings for Pseudo-Boolean Constraints, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal Base Encodings for Pseudo-Boolean Constraints will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-73974