Abstract
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 language | English |
---|---|
Title of host publication | Principles and Practice of Constraint Programming - CP 2009 - 15th International Conference, CP 2009, Proceedings |
Publisher | Springer |
Pages | 367-382 |
Number of pages | 16 |
ISBN (Print) | 3642042430, 9783642042430 |
DOIs | |
Publication status | Published - 2 Nov 2009 |
Externally published | Yes |
Event | International Conference on Principles and Practice of Constraint Programming 2009 - Lisbon, Portugal Duration: 22 Sept 2009 → 24 Sept 2009 Conference number: 15th https://link.springer.com/book/10.1007%2F978-3-642-04244-7 (Conference Proceedings) |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 5732 LNCS |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Conference
Conference | International Conference on Principles and Practice of Constraint Programming 2009 |
---|---|
Abbreviated title | CP 2009 |
Country/Territory | Portugal |
City | Lisbon |
Period | 22/09/09 → 24/09/09 |
Internet address |
|