DMCA
Why �������? Frequently Asked Questions about a New Language for Specifying Combinatorial Problems
BibTeX
@MISC{Frisch_why�������?,
author = {Alan M. Frisch and Matthew Grum and Christopher Jefferson and Bernadette Martínez Hernández and Ian Miguel},
title = {Why �������? Frequently Asked Questions about a New Language for Specifying Combinatorial Problems},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. Essence is a new language for specifying combinatorial (decision or optimisation) problems at a high level of abstraction. Since its introduction, a number of misconceptions about the language and its purpose have arisen in the constraint community. This FAQ addresses some of the frequently arising questions and tries clarify some common misconceptions. This document is not intended to serve as an introduction to the Essence language; that is handled elsewhere [6]). Rather, this document is intended to complement such an introduction. Nonetheless, the answer to the first question provides a very brief introduction to the language. What is �������? Essence is a new language for specifying combinatorial (decision or optimisation) problems at a high level of abstraction. Essence is the result of our attempt to design a formal language that enables problem specifications that are similar to rigorous specifications that use a mixture of natural language and discrete mathematics, such as those catalogued by Garey and Johnson [9].
