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

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

1 2 next

  1. Abdesselam, Abdelmalek; Ikenmeyer, Christian; Royle, Gordon: 16,051 formulas for Ottaviani’s invariant of cubic threefolds (2016)
  2. 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)
  3. Thorstensen, Evgenij: Structural decompositions for problems with global constraints (2016)
  4. Gent, Ian; Kitaev, Sergey; Konovalov, Alexander; Linton, Steve; Nightingale, Peter: $S$-crucial and bicrucial permutations with respect to squares (2015)
  5. Distler, Andreas; Kelsey, Tom: The semigroups of order 9 and their automorphism groups. (2014)
  6. Gent, Ian P.; Jefferson, Christopher; Linton, Steve; Miguel, Ian; Nightingale, Peter: Generating custom propagators for arbitrary constraints (2014)
  7. Prud’homme, Charles; Lorca, Xavier; Douence, Rémi; Jussien, Narendra: Propagation engine prototyping with a domain specific language (2014)
  8. 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)
  9. Beldiceanu, Nicolas; Carlsson, Mats; Flener, Pierre; Pearson, Justin: On the reification of global constraints (2013)
  10. Correia, Marco; Barahona, Pedro: View-based propagation of decomposable constraints (2013)
  11. Metodi, Amit; Codish, Michael; Stuckey, Peter J.: Boolean equi-propagation for concise and efficient SAT encodings of combinatorial problems (2013)
  12. Nightingale, Peter; Gent, Ian P.; Jefferson, Christopher; Miguel, Ian: Short and long supports for constraint propagation (2013)
  13. Schulte, Christian; Tack, Guido: View-based propagator derivation (2013)
  14. Hnich, Brahim; Rossi, Roberto; Tarim, S.Armagan; Prestwich, Steven: Filtering algorithms for global chance constraints (2012)
  15. Köksal, Ali Sinan; Kuncak, Viktor; Suter, Philippe: Constraints as control (2012) ioport
  16. Nica, Iulia; Wotawa, Franz: The SiMoL modeling language for simulation and (re-)configuration (2012) ioport
  17. Prestwich, Steve D.; Hnich, Brahim; Simonis, Helmut; Rossi, Roberto; Tarim, S.Armagan: Partial symmetry breaking by local search in the group (2012) ioport
  18. Wotawa, Franz; Nica, Mihai; Moraru, Iulia: Automated debugging based on a constraint model of the program and a test case (2012)
  19. Ansótegui, Carlos; Béjar, Ramón; Fernández, Cèsar; Gomes, Carla; Mateu, Carles: Generating highly balanced sudoku problems as hard problems (2011) ioport
  20. Bovdi, V.A.; Jespers, E.; Konovalov, A.B.: Torsion units in integral group rings of Janko simple groups. (2011)

1 2 next

Further publications can be found at: