A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
The Proper Treatment of Undefinedness in Constraint Languages
[chapter]
2009
Lecture Notes in Computer Science
Any sufficiently complex finite-domain constraint modelling language has the ability to express undefined values, for example division by zero, or array index out of bounds. This paper gives the first systematic treatment of undefinedness for finite-domain constraint languages. We present three alternative semantics for undefinedness, and for each of the semantics show how to map models that contain undefined expressions into equivalent models that do not. The resulting models can be implemented using existing constraint solving technology.
doi:10.1007/978-3-642-04244-7_30
fatcat:dk4yyozkhzculbec7r5n4sycmu