MINION is a new constraint solver, which is very fast and scales well as problem size increases. Empirical results on standard benchmarks show orders of magnitude performance gains over state-of-the-art constraint toolkits. These gains increase with problem size --- MINION delivers scalable constraint solving. MINION is a general-purpose constraint solver, with an expressive input language based on the common constraint modelling device of matrix models. Focussing on matrix models supports a lean, highly-optimised implementation. This contrasts with current constraint toolkits, which, in order to provide ever more modelling and solving options, have become progressively more complex at the cost of both performance and usability. MINION is a black box from the user point of view, deliberately providing few options. This, combined with its raw speed, makes MINION a substantial step towards Puget’s `Model and Run’ constraint solving paradigm.

References in zbMATH (referenced in 40 articles )

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

1 2 next

  1. Cameron, Peter J.; Gadouleau, Maximilien; Mitchell, James D.; Peresse, Yann: Chains of subsemigroups (2017)
  2. Michel, L.; Van Hentenryck, P.: A microkernel architecture for constraint programming (2017)
  3. Nightingale, Peter; Akgün, Özgür; Gent, Ian P.; Jefferson, Christopher; Miguel, Ian; Spracklen, Patrick: Automatically improving constraint models in Savile row (2017)
  4. Abdesselam, Abdelmalek; Ikenmeyer, Christian; Royle, Gordon: 16,051 formulas for Ottaviani’s invariant of cubic threefolds (2016)
  5. Araújo, João; Bentz, Wolfram; Cameron, Peter J.; Royle, Gordon; Schaefer, Artur: Primitive groups, graph endomorphisms and synchronization (2016)
  6. Banković, Milan: Extending SMT solvers with support for finite domain alldifferent constraint (2016)
  7. Bischl, Bernd; Kerschke, Pascal; Kotthoff, Lars; Lindauer, Marius; Malitsky, Yuri; Fréchette, Alexandre; Hoos, Holger; Hutter, Frank; Leyton-Brown, Kevin; Tierney, Kevin; Vanschoren, Joaquin: ASlib: a benchmark library for algorithm selection (2016)
  8. Martis, Michael; Bamberg, John; Morris, Sylvia: An enumeration of certain projective ternary two-weight codes (2016)
  9. Thorstensen, Evgenij: Structural decompositions for problems with global constraints (2016)
  10. Gent, Ian; Kitaev, Sergey; Konovalov, Alexander; Linton, Steve; Nightingale, Peter: $S$-crucial and bicrucial permutations with respect to squares (2015)
  11. McKay, Brendan D.; Wanless, Ian M.; Zhang, Xiande: The order of automorphisms of quasigroups (2015)
  12. Distler, Andreas; Kelsey, Tom: The semigroups of order 9 and their automorphism groups. (2014)
  13. Gent, Ian P.; Jefferson, Christopher; Linton, Steve; Miguel, Ian; Nightingale, Peter: Generating custom propagators for arbitrary constraints (2014)
  14. Prud’homme, Charles; Lorca, Xavier; Douence, Rémi; Jussien, Narendra: Propagation engine prototyping with a domain specific language (2014)
  15. Ansótegui, Carlos; Béjar, Ramón; Fernández, Cèsar; Mateu, Carles: On the hardness of solving edge matching puzzles as SAT or CSP problems (2013)
  16. Beldiceanu, Nicolas; Carlsson, Mats; Flener, Pierre; Pearson, Justin: On the reification of global constraints (2013)
  17. Correia, Marco; Barahona, Pedro: View-based propagation of decomposable constraints (2013)
  18. Metodi, Amit; Codish, Michael; Stuckey, Peter J.: Boolean equi-propagation for concise and efficient SAT encodings of combinatorial problems (2013)
  19. Nightingale, Peter; Gent, Ian P.; Jefferson, Christopher; Miguel, Ian: Short and long supports for constraint propagation (2013)
  20. Schulte, Christian; Tack, Guido: View-based propagator derivation (2013)

1 2 next

Further publications can be found at: