Sciweavers

Share
CONSTRAINTS
2008

Essence : A constraint language for specifying combinatorial problems

9 years 2 months ago
Essence : A constraint language for specifying combinatorial problems
Abstract. 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. 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.
Alan M. Frisch, Warwick Harvey, Christopher Jeffer
Added 09 Dec 2010
Updated 09 Dec 2010
Type Journal
Year 2008
Where CONSTRAINTS
Authors Alan M. Frisch, Warwick Harvey, Christopher Jefferson, Bernadette Martínez Hernández, Ian Miguel
Comments (0)
books