The proper treatment of undefinedness in constraint languages

Alan M. Frisch, Peter J. Stuckey

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

14 Citations (Scopus)


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.

Original languageEnglish
Title of host publicationPrinciples and Practice of Constraint Programming - CP 2009 - 15th International Conference, CP 2009, Proceedings
Number of pages16
ISBN (Print)3642042430, 9783642042430
Publication statusPublished - 2 Nov 2009
Externally publishedYes
EventInternational Conference on Principles and Practice of Constraint Programming 2009 - Lisbon, Portugal
Duration: 22 Sept 200924 Sept 2009
Conference number: 15th (Conference Proceedings)

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume5732 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


ConferenceInternational Conference on Principles and Practice of Constraint Programming 2009
Abbreviated titleCP 2009
Internet address

Cite this