Box constraint collections for adhoc constraints

Chi Kan Cheng, Jimmy Ho Man Lee, Peter J. Stuckey

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

10 Citations (Scopus)


In this paper, we propose a new language-independent representation of adhoc constraints, called a box constraint collection. Using constructive disjunction, this representation achieves domain consistency. We develop an algorithm to automatically generate a box constraint collection for a given adhoc constraint. The result is guaranteed to be complete and correct, and achieve domain consistency. The constructive disjunction propagator for the box constraint collection can be efficiently implemented using indexicals. We give correctness and completeness result for our compilation scheme, and outline optimization techniques. Experiments show that our representation is simple, compact, and propagates efficiently.

Original languageEnglish
Title of host publicationPrinciples and Practice of Constraint Programming – CP 2003
Subtitle of host publication9th International Conference, CP 2003 Kinsale, Ireland, September 29 – October 3, 2003 Proceedings
EditorsFrancesca Rossi
Place of PublicationBerlin Germany
Number of pages15
ISBN (Print)3540202021
Publication statusPublished - 1 Dec 2003
Externally publishedYes
EventInternational Conference on Principles and Practice of Constraint Programming 2003 - Kinsale, Ireland
Duration: 29 Sept 20033 Oct 2003
Conference number: 9th (Proceedings)

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743


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

Cite this