The Proper Treatment of Undefinedness in Constraint Languages

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.

• Type: Journal
• Year: 2009
• Where: CP
• Authors: Alan M. Frisch, Peter J. Stuckey
• Keywords: Artificial Intelligence, Complex Finite-domain Constraint, CP 2009, Finite-domain Constraint, Finite-domain Constraint Languages