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 130 of 139 in the submission

Output title

The proper treatment of undefinedness in constraint languages

Type

E - Conference contribution

DOI

10.1007/978-3-642-04244-7_30

Name of conference/published proceedings

Principles and Practice of Constraint Programming - CP 2009 : 15th International Conference, CP 2009 Lisbon, Portugal, September 20-24, 2009 Proceedings

Volume number

5732

Issue number

First page of article

367

ISSN of proceedings

0302-9743

Year of publication

2009

URL

http://link.springer.com/chapter/10.1007/978-3-642-04244-7_30

Number of additional authors

Additional information

<22>The semantics and implementation of undefinedness was a long

recognised problem among researchers working on ESSENCE and

MiniZinc/Zinc, the two most expressive declarative constraint

languages. Some forwarded strong arguments that a language with a

three-valued semantics could not be compiled to existing constraint

solvers, which are all inherently based on two values. The solution

required a novel approach: rather than translate directly to the

underlying solver, translate to an undefinedness-free subset of the

source language. The availability of semantics now makes it possible

to prove correct the transformations that implement constraint

languages and we plan to do this for ESSENCE.

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