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. © 2009 Springer Berlin Heidelberg.
CITATION STYLE
Frisch, A. M., & Stuckey, P. J. (2009). The proper treatment of undefinedness in constraint languages. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5732 LNCS, pp. 367–382). https://doi.org/10.1007/978-3-642-04244-7_30
Mendeley helps you to discover research relevant for your work.