You are in : Home » Results & submissions » Select UOA » 11 - Computer Science and Informatics » View submission: University of York » Outputs » Detail

Output details

11 - Computer Science and Informatics

University of York

Return to search Previous output Next output

Output 52 of 139 in the submission

Article title

ESSENCE: A constraint language for specifying combinatorial problems

Type

D - Journal article

DOI

10.1007/s10601-008-9047-y

Title of journal

Journal of Constraints

Article number

Volume number

Issue number

First page of article

268

ISSN of journal

1383-7133

Year of publication

2008

URL

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

Number of additional authors

Additional information

<22> This 39-page paper extends the influential 8-page IJCAI'07 paper (not RAE returned) by providing a complete exposition of ESSENCE; resolving a fundamental semantics issue; revising ESSENCE's type system to aid expressivity and grammar to improve perspicuity; and comparing ESSENCE to other constraint languages. ESSENCE is the first constraint language whose design focused on abstraction and expressiveness, not implementation, and whose type system is infinite. The richness of ESSENCE has facilitated a study of the theoretical expressiveness of constraint languages (Mitchell and Ternovska, "Expressive Power and Abstraction in ESSENCE") and has motivated and informed the design of other constraint languages.

Interdisciplinary

Cross-referral requested

Research group

G - Artificial Intelligence

Citation count

Proposed double-weighted

Double-weighted statement

Reserve for a double-weighted output

Non-English

English abstract