Universal Booleanization of constraint models
While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mostly focused on the translation of specific types of constraints, such as pseudo Boolean constraints, finite integer linear constraints, and constraints given as explicit listings of allowed tuples. By contrast, we present a translation of constraint models to SAT at language level, using the recently proposed constraint...[Show more]
|Collections||ANU Research Publications|
|Source:||Proceedings of the 14th International Conference on Principles and Practice of Constraint Programming (CP 2008)|
|01_Huang_Universal_Booleanization_of_2008.pdf||190.46 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.