Sugar: A SAT-based Constraint Solver


Overview

Sugar is a SAT-based constraint solver based on a new SAT-encoding method named "order encoding". In the order encoding, a comparison x <= a is encoded by a different Boolean variable for each integer variable x and integer value a. It is an extension of the encoding method proposed by Crawford and Baker for the Job-shop scheduling problems to the finite-domain linear CSP (Constraint Satisfaction Problems).

News

[Aug. 28, 2011]
Sugar version 1.15.0 and Copris (Constraint Programming in Scala) version 1.0.0 are released.
[Oct. 2, 2009]
Sugar version 1.14.6 became the winner in 3 categories out of 7 categories of the 2009 Fourth International CSP Solver Competition. See the results page for more details.
[Sep. 6, 2009]
Sugar version 1.14.6 is released.
[Sep. 22, 2008]
Sugar version 1.13 became the winner in 4 categories out of 10 categories of the 2008 Third International CSP and Max-CSP Solver Competitions. See the results page for more details.

Download

Documents

Technical Papers and Presentation Slides

Related Projects

Links


Naoyuki Tamura
( Last modified: Sun Nov 13 18:18:05 2011 JST ,   ?????  Since Feb 22, 2008 )