×

Essence

swMATH ID: 27491
Software Authors: Frisch, Alan M.; Harvey, Warwick; Jefferson, Chris; Martínez-Hernández, Bernadette; Miguel, Ian
Description: Essence: A constraint language for specifying combinatorial problems. Essence is a formal language for specifying combinatorial problems in a manner similar to natural rigorous specifications that use a mixture of natural language and discrete mathematics. Essence provides a high level of abstraction, much of which is the consequence of the provision of decision variables whose values can be combinatorial objects, such as tuples, sets, multisets, relations, partitions and functions. Essence also allows these combinatorial objects to be nested to arbitrary depth, providing for example sets of partitions, sets of sets of partitions, and so forth. Therefore, a problem that requires finding a complex combinatorial object can be specified directly by using a decision variable whose type is precisely that combinatorial object.
Homepage: https://link.springer.com/article/10.1007%2Fs10601-008-9047-y
Keywords: Constraint languages; Specification languages; Constraint modelling; Constraint programming; Combinatorial problems
Related Software: MiniZinc; Zinc; ESRA; Gecode; COMET; AMPL; NP-SPEC; MINION; Sugar; OPL; Yices; CSPLib; SATzilla; MiniSat; SCIP; meSAT; VRP; z3; MiniSearch; Localizer
Cited in: 25 Publications

Citations by Year