A constraint language for specifying combinatorial problems

Alan Frisch; Warwick Harvey; Chris Jefferson; Bernadette MartÃ­nez-HernÃ¡ndez; Ian Miguel

A constraint language for specifying combinatorial problems

Alan Frisch, Warwick Harvey, Chris Jefferson, Bernadette MartÃnez-HernÃ¡ndez, Ian Miguel

Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

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.

Original language	English
Pages (from-to)	268-306
Number of pages	39
Journal	Journal of Constraints
Volume	13
Issue number	3
Publication status	Published - Sept 2008

Bibliographical note

10.1007/s10601-008-9047-y

Access to Document

http://dx.doi.org/10.1007/s10601-008-9047-y

Cite this

@article{6ea613273da9433a89ac1da9751a7fa5,

title = "A constraint language for specifying combinatorial problems",

abstract = "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.",

author = "Alan Frisch and Warwick Harvey and Chris Jefferson and Bernadette Mart{\~A}nez-Hern{\~A}¡ndez and Ian Miguel",

note = "10.1007/s10601-008-9047-y",

year = "2008",

month = sep,

language = "English",

volume = "13",

pages = "268--306",

journal = "Journal of Constraints",

issn = "1383-7133",

publisher = "Springer",

number = "3",

}

TY - JOUR

T1 - A constraint language for specifying combinatorial problems

AU - Frisch, Alan

AU - Harvey, Warwick

AU - Jefferson, Chris

AU - MartÃnez-HernÃ¡ndez, Bernadette

AU - Miguel, Ian

N1 - 10.1007/s10601-008-9047-y

PY - 2008/9

Y1 - 2008/9

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=47349119905&partnerID=8YFLogxK

M3 - Article

SN - 1383-7133

VL - 13

SP - 268

EP - 306

JO - Journal of Constraints

JF - Journal of Constraints

IS - 3

ER -

A constraint language for specifying combinatorial problems

Abstract

Bibliographical note

Access to Document

Other files and links

Cite this