Using CBR to select solution strategies in constraint programming

Cormac Gebruers; Brahim Hnich; Derek Bridge; Eugene Freuder

doi:10.1007/11536406_19

Using CBR to select solution strategies in constraint programming

Cormac Gebruers
, Brahim Hnich
, Derek Bridge
, Eugene Freuder

University College Cork

Research output: Contribution to journal › Article › peer-review

Abstract

Constraint programming is a powerful paradigm that offers many different strategies for solving problems. Choosing a good strategy is difficult; choosing a poor strategy wastes resources and may result in a problem going unsolved. We show how Case-Based Reasoning can be used to select good strategies. We design experiments which demonstrate that, on two problems with quite different characteristics, CBR can outperform four other strategy selection techniques.

Original language	English
Pages (from-to)	222-236
Number of pages	15
Journal	Lecture Notes in Computer Science
Volume	3620
DOIs	https://doi.org/10.1007/11536406_19
Publication status	Published - 2005
Event	6th International Conference on Case-Based Reasoning, ICCBR 2005 - Chicago, IL, United States Duration: 23 Aug 2005 → 26 Aug 2005

Access to Document

10.1007/11536406_19

Cite this

@article{c8b51ca98561415f95b795f568ab6200,

title = "Using CBR to select solution strategies in constraint programming",

abstract = "Constraint programming is a powerful paradigm that offers many different strategies for solving problems. Choosing a good strategy is difficult; choosing a poor strategy wastes resources and may result in a problem going unsolved. We show how Case-Based Reasoning can be used to select good strategies. We design experiments which demonstrate that, on two problems with quite different characteristics, CBR can outperform four other strategy selection techniques.",

author = "Cormac Gebruers and Brahim Hnich and Derek Bridge and Eugene Freuder",

year = "2005",

doi = "10.1007/11536406\_19",

language = "English",

volume = "3620",

pages = "222--236",

journal = "Lecture Notes in Computer Science",

issn = "0302-9743",

publisher = "Springer Science and Business Media Deutschland GmbH",

note = "6th International Conference on Case-Based Reasoning, ICCBR 2005 ; Conference date: 23-08-2005 Through 26-08-2005",

}

TY - JOUR

T1 - Using CBR to select solution strategies in constraint programming

AU - Gebruers, Cormac

AU - Hnich, Brahim

AU - Bridge, Derek

AU - Freuder, Eugene

PY - 2005

Y1 - 2005

N2 - Constraint programming is a powerful paradigm that offers many different strategies for solving problems. Choosing a good strategy is difficult; choosing a poor strategy wastes resources and may result in a problem going unsolved. We show how Case-Based Reasoning can be used to select good strategies. We design experiments which demonstrate that, on two problems with quite different characteristics, CBR can outperform four other strategy selection techniques.

AB - Constraint programming is a powerful paradigm that offers many different strategies for solving problems. Choosing a good strategy is difficult; choosing a poor strategy wastes resources and may result in a problem going unsolved. We show how Case-Based Reasoning can be used to select good strategies. We design experiments which demonstrate that, on two problems with quite different characteristics, CBR can outperform four other strategy selection techniques.

UR - https://www.scopus.com/pages/publications/26944458114

U2 - 10.1007/11536406_19

DO - 10.1007/11536406_19

M3 - Article

AN - SCOPUS:26944458114

SN - 0302-9743

VL - 3620

SP - 222

EP - 236

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

T2 - 6th International Conference on Case-Based Reasoning, ICCBR 2005

Y2 - 23 August 2005 through 26 August 2005

ER -

Using CBR to select solution strategies in constraint programming

Abstract

Access to Document

Other files and links

Fingerprint

Cite this