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 27 articles )

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

1 2 next

  1. Ahmadian, Mohammad Mahdi; Khatami, Mostafa; Salehipour, Amir; Cheng, T. C. E.: Four decades of research on the open-shop scheduling problem to minimize the makespan (2021)
  2. Lu, Xiao-Nan; Mishima, Miwako; Miyamoto, Nobuko; Jimbo, Masakazu: Optimal and efficient designs for fMRI experiments via two-level circulant almost orthogonal arrays (2021)
  3. Ozolins, Ansis: Dynamic programming approach for solving the open shop problem (2021)
  4. Banbara, Mutsunori; Kaufmann, Benjamin; Ostrowski, Max; Schaub, Torsten: \textitclingcon: the next generation (2017)
  5. 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 \textsfAProVE (2017)
  6. Hebrard, Emmanuel; Huguet, Marie-José; Veysseire, Daniel; Sauvan, Ludivine Boche; Cabon, Bertrand: Constraint programming for planning test campaigns of communications satellites (2017)
  7. Nightingale, Peter; Akgün, Özgür; Gent, Ian P.; Jefferson, Christopher; Miguel, Ian; Spracklen, Patrick: Automatically improving constraint models in Savile Row (2017)
  8. Surynek, Pavel: Time-expanded graph-based propositional encodings for makespan-optimal solving of cooperative path finding problems (2017)
  9. Banković, Milan: Extending SMT solvers with support for finite domain \textttalldifferentconstraint (2016)
  10. Brock-Nannestad, Taus: Space-efficient planar acyclicity constraints. A declarative pearl (2016)
  11. De Cat, Broes; Lierler, Yuliya: Constraint CNF: SAT and CSP language under one roof (2016)
  12. Amadini, Roberto; Gabbrielli, Maurizio; Mauro, Jacopo: Why CP portfolio solvers are (under)utilized? Issues and challenges (2015)
  13. Heule, Marijn J. H.; Szeider, Stefan: A SAT approach to clique-width (2015)
  14. Hoos, Holger; Kaminski, Roland; Lindauer, Marius; Schaub, Torsten: aspeed: solver scheduling via answer set programming (2015)
  15. Ghiduk, Ahmed S.: Automatic generation of basis test paths using variable length genetic algorithm (2014)
  16. Stojadinović, Mirko; Marić, Filip: meSAT: multiple encodings of CSP to SAT (2014)
  17. Bofill, Miquel; Palahí, Miquel; Suy, Josep; Villaret, Mateu: Solving constraint satisfaction problems with SAT modulo theories (2012)
  18. Codish, Michael; Giesl, Jürgen; Schneider-Kamp, Peter; Thiemann, René: SAT solving for termination proofs with recursive path orders and dependency pairs (2012)
  19. Janičić, Predrag: URSA: a system for uniform reduction to SAT (2012)
  20. Schockaert, Steven; Janssen, Jeroen; Vermeir, Dirk: Satisfiability checking in Łukasiewicz logic as finite constraint satisfaction (2012)

1 2 next

Further publications can be found at: