Sugar is a SAT-based Constraint Solver. Constraint Satisfaction Problem (CSP) is encoded to a Boolean CNF formula, and it is solved by an external SAT solver. Sugar also can solve Constraint Optimization Problems (COP) and Max-CSP. Sugar is an award winning solver of global constraint categories at the International CSP Solver Competitions in 2008 and 2009, and of four categories at the 2008 International Max-CSP Solver Competition. See the results of Sugar in CSP Solver Competitions for more details.

References in zbMATH (referenced in 19 articles )

Showing results 1 to 19 of 19.
Sorted by year (citations)

  1. Giesl, Jürgen; Aschermann, Cornelius; Brockschmidt, Marc; Emmes, Fabian; Frohn, Florian; Fuhs, Carsten; Hensel, Jera; Otto, Carsten; Plücker, Martin; Schneider-Kamp, Peter; Ströder, Thomas; Swiderski, Stephanie; Thiemann, René: Analyzing program termination and complexity automatically with \ssfAProVE (2017)
  2. Nightingale, Peter; Akgün, Özgür; Gent, Ian P.; Jefferson, Christopher; Miguel, Ian; Spracklen, Patrick: Automatically improving constraint models in Savile row (2017)
  3. Banković, Milan: Extending SMT solvers with support for finite domain alldifferent constraint (2016)
  4. Brock-Nannestad, Taus: Space-efficient planar acyclicity constraints. A declarative pearl (2016)
  5. Amadini, Roberto; Gabbrielli, Maurizio; Mauro, Jacopo: Why CP portfolio solvers are (under)utilized? issues and challenges (2015)
  6. Heule, Marijn J.H.; Szeider, Stefan: A SAT approach to clique-width (2015)
  7. Ghiduk, Ahmed S.: Automatic generation of basis test paths using variable length genetic algorithm (2014)
  8. Stojadinović, Mirko; Marić, Filip: meSAT: multiple encodings of CSP to SAT (2014)
  9. Bofill, Miquel; Palahí, Miquel; Suy, Josep; Villaret, Mateu: Solving constraint satisfaction problems with SAT modulo theories (2012)
  10. Codish, Michael; Giesl, Jürgen; Schneider-Kamp, Peter; Thiemann, René: SAT solving for termination proofs with recursive path orders and dependency pairs (2012)
  11. Janičić, Predrag: URSA: a system for uniform reduction to SAT (2012)
  12. Schockaert, Steven; Janssen, Jeroen; Vermeir, Dirk: Satisfiability checking in \Lukasiewiczlogic as finite constraint satisfaction (2012)
  13. Tanjo, Tomoya; Tamura, Naoyuki; Banbara, Mutsunori: A compact and efficient SAT-encoding of finite domain CSP (2011) ioport
  14. Drescher, Christian: Constraint answer set programming systems (2010)
  15. Lecoutre, Christophe; Roussel, Olivier; van Dongen, M.R.C.: Promoting robust black-box solvers through competitions (2010)
  16. Ohrimenko, Olga; Stuckey, Peter J.; Codish, Michael: Propagation via lazy clause generation (2009)
  17. Tamura, Naoyuki; Taga, Akiko; Kitagawa, Satoshi; Banbara, Mutsunori: Compiling finite linear CSP into SAT (2009)
  18. Andresen, Michael; Bräsel, Heidemarie; Mörig, Marc; Tusch, Jan; Werner, Frank; Willenius, Per: Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop (2008)
  19. Tamura, Naoyuki; Taga, Akiko; Kitagawa, Satoshi; Banbara, Mutsunori: Compiling finite linear CSP into SAT (2006)

Further publications can be found at: