2016年12月25日 · Sugar can solve COP (Constraint Optimization Problems) and Max-CSP in addition to CSP. Sugar can handle problems written in abridged notation of XCSP 2.1 format used at the International CSP and Max-CSP Solver Competitions. Various CSP instances in XCSP format can be found at Benchmarks in XCSP 2.1.

Sugar is a CSP (Constraint Satisfaction Problem) solver by encoding the CSP into a SAT (Satisfiability Testing) problem and searching a solution with an efficient SAT solver. Order encoding method is used for the SAT translation. Sugar can also solve COPs (Constraint Optimization Problems) and Max-CSPs by using the SAT solver multiple times.

制約ソルバーのSugar (A SAT-based Constraint Solver)は， 与えられた制約充足問題(CSP, Constraint Satisfaction Problem)や組合せ最適化問題を 命題論理の充足可能性判定問題(SAT)に符号化(変換)し， 高速のSATソルバー(MiniSat等)を用いて解を求める SAT型の制約ソルバーで …

cspuz is a Python library for making puzzle solvers based on CSP reduction. It offers: Intuitive interfaces to use efficient CSP solvers from Python, and; A collection of functionalities which makes writing puzzle solvers easier.

Sugar1 is a SAT-based constraint solver based on the order encoding [14,15,16]. It can solve CSP, COP (Constraint Optimization Problem), and Max-CSP by translating the problem instance to a SAT instance and then solving the trans-

The sugar solver solves a finite linear CSP by translating it into a SAT problem by using order encoding method [1] and then solving the translated SAT problem by the MiniSat solver [2].

A wrapper library for python to solve a Constraint Satisfaction Problem with sugar (http://bach.istc.kobe-u.ac.jp/sugar/) and minisat2 (http://minisat.se/MiniSat.html) Csp-Solver can be installed via pip from this repository. In addition to the python package, an installation of minisat2 is needed in PATH (or passed to CLI).

Azucar is a SAT-based CSP solver which is an enhancement version of Sugar which is an award-winning system of GLOBAL categories of the 2008 and 2009 International CSP solver competitions. It can solve finite non-linear Constraint Satisfaction Problems (CSP), Constraint Optimization Problems (COP), and Max-CSP over integers.

2002年7月8日 · Sugar: A SAT-based CSP Solver —Results summary of the 3rd intertional CSP solver competition---(PDF slide) describes our report. Please check 2008 the Third International CSP and Max-CSP Solver Competitions for the detailed results.

制約充足問題(Constraint satisfaction problem, CSP)というのをご存知だろうか？ まったく文字通りの意味で、たくさんの制約が与えられて、それらの制約を全部充たす（充足する）解を求める問題だ。