The Design of ESSENCE: A Constraint Language for Specifying Combinatorial Problems

Alan M. Frisch; Matthew Grum; Christopher Jefferson; Bernadette Martínez Hernández; Ian Miguel

The Design of ESSENCE: A Constraint Language for Specifying Combinatorial Problems

Alan M. Frisch, Matthew Grum, Christopher Jefferson, Bernadette Martínez Hernández, Ian Miguel

Computer Science

Research output: Contribution to conference › Paper › peer-review

Abstract

ESSENCE is a new 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, thus 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 directly specified by using a decision variable whose type is precisely that combinatorial object.

Original language	Undefined/Unknown
Pages	80-87
Publication status	Published - 2007

Access to Document

Cite this

@conference{9a348782935b494c8194082d440b4778,

title = "The Design of ESSENCE: A Constraint Language for Specifying Combinatorial Problems",

abstract = "ESSENCE is a new 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, thus 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 directly specified by using a decision variable whose type is precisely that combinatorial object.",

author = "Frisch, {Alan M.} and Matthew Grum and Christopher Jefferson and Hern{\'a}ndez, {Bernadette Mart{\'i}nez} and Ian Miguel",

year = "2007",

language = "Undefined/Unknown",

pages = "80--87",

}

TY - CONF

T1 - The Design of ESSENCE

T2 - A Constraint Language for Specifying Combinatorial Problems

AU - Frisch, Alan M.

AU - Grum, Matthew

AU - Jefferson, Christopher

AU - Hernández, Bernadette Martínez

AU - Miguel, Ian

PY - 2007

Y1 - 2007

N2 - ESSENCE is a new 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, thus 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 directly specified by using a decision variable whose type is precisely that combinatorial object.

AB - ESSENCE is a new 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, thus 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 directly specified by using a decision variable whose type is precisely that combinatorial object.

M3 - Paper

SP - 80

EP - 87

ER -