Box constraint collections for adhoc constraints

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

doi:10.1007/978-3-540-45193-8_15

Box constraint collections for adhoc constraints

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

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

10 Citations (Scopus)

Abstract

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 language	English
Title of host publication	Principles and Practice of Constraint Programming – CP 2003
Subtitle of host publication	9th International Conference, CP 2003 Kinsale, Ireland, September 29 – October 3, 2003 Proceedings
Editors	Francesca Rossi
Place of Publication	Berlin Germany
Publisher	Springer
Pages	214-228
Number of pages	15
ISBN (Print)	3540202021
DOIs	https://doi.org/10.1007/978-3-540-45193-8_15
Publication status	Published - 1 Dec 2003
Externally published	Yes
Event	International Conference on Principles and Practice of Constraint Programming 2003 - Kinsale, Ireland Duration: 29 Sep 2003 → 3 Oct 2003 Conference number: 9th https://link-springer-com.ezproxy.lib.monash.edu.au/book/10.1007/b13743 (Proceedings)

Publication series

Name	Lecture Notes in Computer Science
Publisher	Springer
Volume	2833
ISSN (Print)	0302-9743

Conference

Conference	International Conference on Principles and Practice of Constraint Programming 2003
Abbreviated title	CP 2003
Country/Territory	Ireland
City	Kinsale
Period	29/09/03 → 3/10/03
Internet address	https://link-springer-com.ezproxy.lib.monash.edu.au/book/10.1007/b13743 (Proceedings)

Access to Document

10.1007/978-3-540-45193-8_15

Cite this

Cheng, C. K., Lee, J. H. M., & Stuckey, P. J. (2003). Box constraint collections for adhoc constraints. In F. Rossi (Ed.), Principles and Practice of Constraint Programming – CP 2003: 9th International Conference, CP 2003 Kinsale, Ireland, September 29 – October 3, 2003 Proceedings (pp. 214-228). (Lecture Notes in Computer Science; Vol. 2833). Springer. https://doi.org/10.1007/978-3-540-45193-8_15

Cheng, Chi Kan ; Lee, Jimmy Ho Man ; Stuckey, Peter J. / Box constraint collections for adhoc constraints. Principles and Practice of Constraint Programming – CP 2003: 9th International Conference, CP 2003 Kinsale, Ireland, September 29 – October 3, 2003 Proceedings. editor / Francesca Rossi. Berlin Germany : Springer, 2003. pp. 214-228 (Lecture Notes in Computer Science).

@inproceedings{3c2d583cc4094008b2a044a571f23403,

title = "Box constraint collections for adhoc constraints",

abstract = "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.",

author = "Cheng, {Chi Kan} and Lee, {Jimmy Ho Man} and Stuckey, {Peter J.}",

year = "2003",

month = dec,

day = "1",

doi = "10.1007/978-3-540-45193-8_15",

language = "English",

isbn = "3540202021",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "214--228",

editor = "Francesca Rossi",

booktitle = "Principles and Practice of Constraint Programming – CP 2003",

note = "International Conference on Principles and Practice of Constraint Programming 2003, CP 2003 ; Conference date: 29-09-2003 Through 03-10-2003",

url = "https://link-springer-com.ezproxy.lib.monash.edu.au/book/10.1007/b13743",

}

Cheng, CK, Lee, JHM & Stuckey, PJ 2003, Box constraint collections for adhoc constraints. in F Rossi (ed.), Principles and Practice of Constraint Programming – CP 2003: 9th International Conference, CP 2003 Kinsale, Ireland, September 29 – October 3, 2003 Proceedings. Lecture Notes in Computer Science, vol. 2833, Springer, Berlin Germany, pp. 214-228, International Conference on Principles and Practice of Constraint Programming 2003, Kinsale, Ireland, 29/09/03. https://doi.org/10.1007/978-3-540-45193-8_15

Box constraint collections for adhoc constraints. / Cheng, Chi Kan; Lee, Jimmy Ho Man; Stuckey, Peter J.

Principles and Practice of Constraint Programming – CP 2003: 9th International Conference, CP 2003 Kinsale, Ireland, September 29 – October 3, 2003 Proceedings. ed. / Francesca Rossi. Berlin Germany : Springer, 2003. p. 214-228 (Lecture Notes in Computer Science; Vol. 2833).

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper › Research › peer-review

TY - GEN

T1 - Box constraint collections for adhoc constraints

AU - Cheng, Chi Kan

AU - Lee, Jimmy Ho Man

AU - Stuckey, Peter J.

N1 - Conference code: 9th

PY - 2003/12/1

Y1 - 2003/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=29344459159&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-45193-8_15

DO - 10.1007/978-3-540-45193-8_15

M3 - Conference Paper

AN - SCOPUS:29344459159

SN - 3540202021

T3 - Lecture Notes in Computer Science

SP - 214

EP - 228

BT - Principles and Practice of Constraint Programming – CP 2003

A2 - Rossi, Francesca

PB - Springer

CY - Berlin Germany

T2 - International Conference on Principles and Practice of Constraint Programming 2003

Y2 - 29 September 2003 through 3 October 2003

ER -

Cheng CK, Lee JHM, Stuckey PJ. Box constraint collections for adhoc constraints. In Rossi F, editor, Principles and Practice of Constraint Programming – CP 2003: 9th International Conference, CP 2003 Kinsale, Ireland, September 29 – October 3, 2003 Proceedings. Berlin Germany: Springer. 2003. p. 214-228. (Lecture Notes in Computer Science). https://doi.org/10.1007/978-3-540-45193-8_15

Box constraint collections for adhoc constraints

Abstract

Publication series

Conference

Access to Document

Other files and links

Cite this