By the same authors

From the same journal

From the same journal

A constraint language for specifying combinatorial problems

Research output: Contribution to journalArticle

Author(s)

  • Alan Frisch
  • Warwick Harvey
  • Chris Jefferson
  • Bernadette Martínez-Hernández
  • Ian Miguel

Department/unit(s)

Publication details

JournalJournal of Constraints
DatePublished - Sep 2008
Issue number3
Volume13
Number of pages39
Pages (from-to)268-306
Original languageEnglish

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.

Bibliographical note

10.1007/s10601-008-9047-y

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations