TY - GEN
T1 - Simplifying pseudo-boolean constraints in residual number systems
AU - Fekete, Yoav
AU - Codish, Michael
N1 - Funding Information: Supported by the Israel Science Foundation, grant 182/13.
PY - 2014/1/1
Y1 - 2014/1/1
N2 - We present an encoding of pseudo-Boolean constraints based on decomposition with respect to a residual number system. We illustrate that careful selection of the base for the residual number system, and when bit-blasting modulo arithmetic, results in a powerful approach when solving hard pseudo-Boolean constraints. We demonstrate, using a range of pseudo-Boolean constraint solvers, that the obtained constraints are often substantially easier to solve.
AB - We present an encoding of pseudo-Boolean constraints based on decomposition with respect to a residual number system. We illustrate that careful selection of the base for the residual number system, and when bit-blasting modulo arithmetic, results in a powerful approach when solving hard pseudo-Boolean constraints. We demonstrate, using a range of pseudo-Boolean constraint solvers, that the obtained constraints are often substantially easier to solve.
UR - http://www.scopus.com/inward/record.url?scp=84958543404&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-09284-3_26
DO - 10.1007/978-3-319-09284-3_26
M3 - Conference contribution
SN - 9783319092836
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 351
EP - 366
BT - Theory and Applications of Satisfiability Testing, SAT 2014 - 17th International Conference, Held as Part of theVienna Summer of Logic, VSL 2014, Proceedings
PB - Springer Verlag
T2 - 17th International Conference on Theory and Applications of Satisfiability Testing, SAT 2014, Held as Part of the Vienna Summer of Logic, VSL 2014
Y2 - 14 July 2014 through 17 July 2014
ER -