Skip navigation
Skip navigation

Universal Booleanization of constraint models

Huang, Jinbo


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]

CollectionsANU Research Publications
Date published: 2008
Type: Conference paper
Source: Proceedings of the 14th International Conference on Principles and Practice of Constraint Programming (CP 2008)
DOI: 10.1007%2F978-3-540-85958-1_10


File Description SizeFormat Image
01_Huang_Universal_Booleanization_of_2008.pdf190.46 kBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  22 January 2019/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator