Sequential precede chain for value symmetry elimination

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

Abstract

The main global constraint used for removing value symmetries is the VALUE-PRECEDE-CHAIN constraint which forces the first occurences of values in an ordered list to be appear in order. We introduce the seq-precede-chain constraint for the restricted, but common, case where the values are 1,2, … , k, and variables in the constraint do not take values higher than k. We construct an efficient domain consistent propagator for this constraint, and show how we can generate explanations for its propagation. This leads us to an efficient domain consistent decomposition. We show how we can map any VALUE-PRECEDE-CHAIN to use instead SEQ-PRECEDE-CHAIN. Experiments show that the new propagator and decomposition are better than existing approachs to propagating VALUE-PRECEDE-CHAIN.

Original languageEnglish
Title of host publicationPrinciples and Practice of Constraint Programming
Subtitle of host publication24th International Conference, CP 2018 Lille, France, August 27–31, 2018 Proceedings
EditorsJohn Hooker
Place of PublicationCham Switzerland
PublisherSpringer
Pages144-159
Number of pages16
ISBN (Electronic)9783319983349
ISBN (Print)9783319983332
DOIs
Publication statusPublished - 2018
EventInternational Conference on Principles and Practice of Constraint Programming 2018 - Lille, France
Duration: 27 Aug 201831 Aug 2018
Conference number: 24th
http://cp2018.a4cp.org/

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume11008
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

ConferenceInternational Conference on Principles and Practice of Constraint Programming 2018
Abbreviated titleCP 2018
CountryFrance
CityLille
Period27/08/1831/08/18
Internet address

Cite this

Gange, G., & Stuckey, P. J. (2018). Sequential precede chain for value symmetry elimination. In J. Hooker (Ed.), Principles and Practice of Constraint Programming : 24th International Conference, CP 2018 Lille, France, August 27–31, 2018 Proceedings (pp. 144-159). (Lecture Notes in Computer Science ; Vol. 11008 ). Cham Switzerland: Springer. https://doi.org/10.1007/978-3-319-98334-9_10
Gange, Graeme ; Stuckey, Peter J. / Sequential precede chain for value symmetry elimination. Principles and Practice of Constraint Programming : 24th International Conference, CP 2018 Lille, France, August 27–31, 2018 Proceedings. editor / John Hooker. Cham Switzerland : Springer, 2018. pp. 144-159 (Lecture Notes in Computer Science ).
@inproceedings{b6e40caa6c324d95b42bfc1bab5a5605,
title = "Sequential precede chain for value symmetry elimination",
abstract = "The main global constraint used for removing value symmetries is the VALUE-PRECEDE-CHAIN constraint which forces the first occurences of values in an ordered list to be appear in order. We introduce the seq-precede-chain constraint for the restricted, but common, case where the values are 1,2, … , k, and variables in the constraint do not take values higher than k. We construct an efficient domain consistent propagator for this constraint, and show how we can generate explanations for its propagation. This leads us to an efficient domain consistent decomposition. We show how we can map any VALUE-PRECEDE-CHAIN to use instead SEQ-PRECEDE-CHAIN. Experiments show that the new propagator and decomposition are better than existing approachs to propagating VALUE-PRECEDE-CHAIN.",
author = "Graeme Gange and Stuckey, {Peter J.}",
year = "2018",
doi = "10.1007/978-3-319-98334-9_10",
language = "English",
isbn = "9783319983332",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "144--159",
editor = "Hooker, {John }",
booktitle = "Principles and Practice of Constraint Programming",

}

Gange, G & Stuckey, PJ 2018, Sequential precede chain for value symmetry elimination. in J Hooker (ed.), Principles and Practice of Constraint Programming : 24th International Conference, CP 2018 Lille, France, August 27–31, 2018 Proceedings. Lecture Notes in Computer Science , vol. 11008 , Springer, Cham Switzerland, pp. 144-159, International Conference on Principles and Practice of Constraint Programming 2018, Lille, France, 27/08/18. https://doi.org/10.1007/978-3-319-98334-9_10

Sequential precede chain for value symmetry elimination. / Gange, Graeme; Stuckey, Peter J.

Principles and Practice of Constraint Programming : 24th International Conference, CP 2018 Lille, France, August 27–31, 2018 Proceedings. ed. / John Hooker. Cham Switzerland : Springer, 2018. p. 144-159 (Lecture Notes in Computer Science ; Vol. 11008 ).

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

TY - GEN

T1 - Sequential precede chain for value symmetry elimination

AU - Gange, Graeme

AU - Stuckey, Peter J.

PY - 2018

Y1 - 2018

N2 - The main global constraint used for removing value symmetries is the VALUE-PRECEDE-CHAIN constraint which forces the first occurences of values in an ordered list to be appear in order. We introduce the seq-precede-chain constraint for the restricted, but common, case where the values are 1,2, … , k, and variables in the constraint do not take values higher than k. We construct an efficient domain consistent propagator for this constraint, and show how we can generate explanations for its propagation. This leads us to an efficient domain consistent decomposition. We show how we can map any VALUE-PRECEDE-CHAIN to use instead SEQ-PRECEDE-CHAIN. Experiments show that the new propagator and decomposition are better than existing approachs to propagating VALUE-PRECEDE-CHAIN.

AB - The main global constraint used for removing value symmetries is the VALUE-PRECEDE-CHAIN constraint which forces the first occurences of values in an ordered list to be appear in order. We introduce the seq-precede-chain constraint for the restricted, but common, case where the values are 1,2, … , k, and variables in the constraint do not take values higher than k. We construct an efficient domain consistent propagator for this constraint, and show how we can generate explanations for its propagation. This leads us to an efficient domain consistent decomposition. We show how we can map any VALUE-PRECEDE-CHAIN to use instead SEQ-PRECEDE-CHAIN. Experiments show that the new propagator and decomposition are better than existing approachs to propagating VALUE-PRECEDE-CHAIN.

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

U2 - 10.1007/978-3-319-98334-9_10

DO - 10.1007/978-3-319-98334-9_10

M3 - Conference Paper

SN - 9783319983332

T3 - Lecture Notes in Computer Science

SP - 144

EP - 159

BT - Principles and Practice of Constraint Programming

A2 - Hooker, John

PB - Springer

CY - Cham Switzerland

ER -

Gange G, Stuckey PJ. Sequential precede chain for value symmetry elimination. In Hooker J, editor, Principles and Practice of Constraint Programming : 24th International Conference, CP 2018 Lille, France, August 27–31, 2018 Proceedings. Cham Switzerland: Springer. 2018. p. 144-159. (Lecture Notes in Computer Science ). https://doi.org/10.1007/978-3-319-98334-9_10