TY - GEN
T1 - Search strategy simulation in constraint booleanization
AU - Huang, Jinbo
PY - 2012
Y1 - 2012
N2 - Within the recently proposed Universal Booleanization framework, we consider the CUMULATIVE constraint, for which the original Boolean encoding proves ineffective, and present a new Boolean encoding that causes the SAT solver to simulate, largely, the search strategy used by some of the best-performing native methods. Apart from providing motivation for future research in a similar direction, we obtain a significantly enhanced version of Universal Booleanization for problems containing CUMULATIVE constraints.
AB - Within the recently proposed Universal Booleanization framework, we consider the CUMULATIVE constraint, for which the original Boolean encoding proves ineffective, and present a new Boolean encoding that causes the SAT solver to simulate, largely, the search strategy used by some of the best-performing native methods. Apart from providing motivation for future research in a similar direction, we obtain a significantly enhanced version of Universal Booleanization for problems containing CUMULATIVE constraints.
UR - http://www.scopus.com/inward/record.url?scp=84893354082&partnerID=8YFLogxK
M3 - Conference contribution
SN - 9781577355601
T3 - Proceedings of the International Conference on Knowledge Representation and Reasoning
SP - 628
EP - 632
BT - 13th International Conference on the Principles of Knowledge Representation and Reasoning, KR 2012
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 13th International Conference on the Principles of Knowledge Representation and Reasoning, KR 2012
Y2 - 10 June 2012 through 14 June 2012
ER -