The Automated Generation of Constraint Programs contains more information about Essence' (as well as ESSENCE and CONJURE).

From the (old) Tailor page:

TAILOR is a tool that facilitates modelling and solving constraint models. TAILOR's graphical user interface (GUI) allows the user to directly solve an Essence' problem model with either solver MINION or GECODE, and is hence especially aimed at people who are novices in constraint programming or have no experience with constraint solvers Minion and Gecode. Note that TAILOR is not intended to compare solvers, but to generate effective solver input from a solver-independent problem model.Thus, Tailor can convert Essence' models to:

Also, it can parse modeling files in XCSP files and convert them to the formats above.

2009-07-25: I blogged about Tailor/Essence' in New Tailor version (v0.3.2) and My Essence'/Tailor page

- alldifferent_except_0.eprime: All different except 0
- assignment.eprime: Simple assignment problem (Winston "Operations Research")
- calculs_d_enfer.eprime: Calculs d'enfer puzzle (alphametic problem)
- coins_grid.eprime: Coins grid problem (Tony Hurliman)
- debruijn.eprime: de Bruijn sequences (both "classical" and "arbitrary")
- diet1.eprime: Simple diet problem
- discrete_tomography.eprime: Discrete tomography.

Param files:

- knapsack.eprime: Simple knapsack problem
- leastDiff.eprime: Least diff, alphametic problem
- map_coloring.eprime: Simple map coloring (Van Hentenryck, OPL book)
- minesweeper.eprime: Minesweeper puzzle, general model to be used with the following problems:
- minesweeper0.param
- minesweeper1.param
- minesweeper2.param
- minesweeper3.param
- minesweeper4.param
- minesweeper5.param
- minesweeper6.param
- minesweeper7.param
- minesweeper8.param
- minesweeper9.param
- minesweeper_basic3.param
- minesweeper_basic4.param
- minesweeper_basic4x4.param
- minesweeper_config_page2.param
- minesweeper_config_page3.param
- minesweeper_german_Lakshtanov.param
- minesweeper_splitter.param
- minesweeper_wire.param

- quasigroup_completion.eprime: Quasigroup completion

Param file: - seseman.eprime: Seseman Convent problem (see Seseman Convent problem)
- send_more_money_any_base.eprime: SEND+MORE=MONEY (any base)
- send_most_money.eprime: SEND+MOST=MONEY (maximising MONEY)
- subset_sum.eprime: Subset sum
- survo_puzzle.eprime: survo_puzzle

Param files: - to_num.eprime: Convert (bidirectionally) between a number and a array of digits.
- who_killed_agatha.eprime: Who killed agatha? (The Dreadsbury Mansion Murder Mystery, an automated reasoning problem)
- xkcd.eprime: xkcd problem (see the xkcd strip for the problem)
- young_tableaux.eprime: Young tableaux and partition
- zebra.eprime: Zebra puzzle

Also, see information about other constraint programming systems:

* My Constraint Programming Blog, especially the Tailor/Minion category

* Constraint Programming

* Common constraint programming problems

* My MiniZinc page

* My Zinc page

* My JaCoP page

* My JaCoP/Scala page

* My Choco page

* My Gecode/R page

* My Comet page

* My Gecode page

* My ECLiPSe page

* My SICStus Prolog page

* My Google CP Solver page

* My OscaR page

* My JSR-331 page

* My Numberjack page

* My AIMMS+CP page

* My B-Prolog page

* My Choco3 page

* My Picat page

Back to my homepage

Created by Hakan Kjellerstrand hakank@gmail.com