Using autonomous search for generating good enumeration strategy blends in constraint programming

Ricardo Soto; Broderick Crawford; Eric Monfroy; Víctor Bustos

doi:10.1007/978-3-642-31137-6_46

Using autonomous search for generating good enumeration strategy blends in constraint programming

Ricardo Soto, Broderick Crawford, Eric Monfroy, Víctor Bustos

SCHOOL OF COMPUTER ENGINEERING

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

34 Scopus citations

Abstract

In Constraint Programming, enumeration strategies play an important role, they can significantly impact the performance of the solving process. However, choosing the right strategy is not simple as its behavior is commonly unpredictable. Autonomous search aims at tackling this concern, it proposes to replace bad performing strategies by more promising ones during the resolution. This process yields a combination of enumeration strategies that worked during the search phase. In this paper, we focus on the study of this combination by carefully tracking the resolution. Our preliminary goal is to find good enumeration strategy blends for a given Constraint Satisfaction Problem.

Original language	English
Title of host publication	Computational Science and Its Applications - 12th International Conference, ICCSA 2012, Proceedings
Pages	607-617
Number of pages	11
Edition	PART 3
DOIs	https://doi.org/10.1007/978-3-642-31137-6_46
State	Published - 2012
Event	12th International Conference on Computational Science and Its Applications, ICCSA 2012 - Salvador de Bahia, Brazil Duration: 18 Jun 2012 → 21 Jun 2012

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	PART 3
Volume	7335 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	12th International Conference on Computational Science and Its Applications, ICCSA 2012
Country/Territory	Brazil
City	Salvador de Bahia
Period	18/06/12 → 21/06/12

Keywords

Artificial Intelligence
Autonomous Search
Constraint Programming

Access to Document

10.1007/978-3-642-31137-6_46

Cite this

Soto, R., Crawford, B., Monfroy, E., & Bustos, V. (2012). Using autonomous search for generating good enumeration strategy blends in constraint programming. In Computational Science and Its Applications - 12th International Conference, ICCSA 2012, Proceedings (PART 3 ed., pp. 607-617). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7335 LNCS, No. PART 3). https://doi.org/10.1007/978-3-642-31137-6_46

Soto, Ricardo ; Crawford, Broderick ; Monfroy, Eric et al. / Using autonomous search for generating good enumeration strategy blends in constraint programming. Computational Science and Its Applications - 12th International Conference, ICCSA 2012, Proceedings. PART 3. ed. 2012. pp. 607-617 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 3).

@inproceedings{10234377521b4776a3134185649336cc,

title = "Using autonomous search for generating good enumeration strategy blends in constraint programming",

abstract = "In Constraint Programming, enumeration strategies play an important role, they can significantly impact the performance of the solving process. However, choosing the right strategy is not simple as its behavior is commonly unpredictable. Autonomous search aims at tackling this concern, it proposes to replace bad performing strategies by more promising ones during the resolution. This process yields a combination of enumeration strategies that worked during the search phase. In this paper, we focus on the study of this combination by carefully tracking the resolution. Our preliminary goal is to find good enumeration strategy blends for a given Constraint Satisfaction Problem.",

keywords = "Artificial Intelligence, Autonomous Search, Constraint Programming",

author = "Ricardo Soto and Broderick Crawford and Eric Monfroy and V{\'i}ctor Bustos",

year = "2012",

doi = "10.1007/978-3-642-31137-6_46",

language = "English",

isbn = "9783642311369",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

number = "PART 3",

pages = "607--617",

booktitle = "Computational Science and Its Applications - 12th International Conference, ICCSA 2012, Proceedings",

edition = "PART 3",

note = "12th International Conference on Computational Science and Its Applications, ICCSA 2012 ; Conference date: 18-06-2012 Through 21-06-2012",

}

Soto, R , Crawford, B, Monfroy, E & Bustos, V 2012, Using autonomous search for generating good enumeration strategy blends in constraint programming. in Computational Science and Its Applications - 12th International Conference, ICCSA 2012, Proceedings. PART 3 edn, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 3, vol. 7335 LNCS, pp. 607-617, 12th International Conference on Computational Science and Its Applications, ICCSA 2012, Salvador de Bahia, Brazil, 18/06/12. https://doi.org/10.1007/978-3-642-31137-6_46

Using autonomous search for generating good enumeration strategy blends in constraint programming. / Soto, Ricardo ; Crawford, Broderick; Monfroy, Eric et al.
Computational Science and Its Applications - 12th International Conference, ICCSA 2012, Proceedings. PART 3. ed. 2012. p. 607-617 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7335 LNCS, No. PART 3).

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

TY - GEN

T1 - Using autonomous search for generating good enumeration strategy blends in constraint programming

AU - Soto, Ricardo

AU - Crawford, Broderick

AU - Monfroy, Eric

AU - Bustos, Víctor

PY - 2012

Y1 - 2012

N2 - In Constraint Programming, enumeration strategies play an important role, they can significantly impact the performance of the solving process. However, choosing the right strategy is not simple as its behavior is commonly unpredictable. Autonomous search aims at tackling this concern, it proposes to replace bad performing strategies by more promising ones during the resolution. This process yields a combination of enumeration strategies that worked during the search phase. In this paper, we focus on the study of this combination by carefully tracking the resolution. Our preliminary goal is to find good enumeration strategy blends for a given Constraint Satisfaction Problem.

AB - In Constraint Programming, enumeration strategies play an important role, they can significantly impact the performance of the solving process. However, choosing the right strategy is not simple as its behavior is commonly unpredictable. Autonomous search aims at tackling this concern, it proposes to replace bad performing strategies by more promising ones during the resolution. This process yields a combination of enumeration strategies that worked during the search phase. In this paper, we focus on the study of this combination by carefully tracking the resolution. Our preliminary goal is to find good enumeration strategy blends for a given Constraint Satisfaction Problem.

KW - Artificial Intelligence

KW - Autonomous Search

KW - Constraint Programming

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

U2 - 10.1007/978-3-642-31137-6_46

DO - 10.1007/978-3-642-31137-6_46

M3 - Conference contribution

AN - SCOPUS:84863895599

SN - 9783642311369

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 607

EP - 617

BT - Computational Science and Its Applications - 12th International Conference, ICCSA 2012, Proceedings

T2 - 12th International Conference on Computational Science and Its Applications, ICCSA 2012

Y2 - 18 June 2012 through 21 June 2012

ER -

Soto R , Crawford B, Monfroy E, Bustos V. Using autonomous search for generating good enumeration strategy blends in constraint programming. In Computational Science and Its Applications - 12th International Conference, ICCSA 2012, Proceedings. PART 3 ed. 2012. p. 607-617. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 3). doi: 10.1007/978-3-642-31137-6_46

Using autonomous search for generating good enumeration strategy blends in constraint programming

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this