Using Local Search for guiding enumeration in constraint solving

Eric Monfroy, Carlos Castro, BRODERICK CRAWFORD LABRIN

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

4 Scopus citations

Abstract

In Constraint Programming, enumeration strategies (selection of a variable and a value of its domain) are crucial for resolution performances. We propose to use Local Search for guiding enumeration: we extend the common variable selection strategies of constraint programming and we achieve the value selection based on a Local Search. The experimental results are rather promising.

Original languageEnglish
Title of host publicationArtificial Intelligence
Subtitle of host publicationMethodology, Systems, and Applications - 12th International Conference, AIMSA 2006, Proceedings
PublisherSpringer Verlag
Pages56-65
Number of pages10
ISBN (Print)3540409300, 9783540409304
StatePublished - 1 Jan 2006
Event12th International Conference on Artificial Intelligence: Methodology, Systems, and Applications, AIMSA 2006 - Varna, Bulgaria
Duration: 12 Sep 200615 Sep 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4183 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference12th International Conference on Artificial Intelligence: Methodology, Systems, and Applications, AIMSA 2006
CountryBulgaria
CityVarna
Period12/09/0615/09/06

Fingerprint Dive into the research topics of 'Using Local Search for guiding enumeration in constraint solving'. Together they form a unique fingerprint.

Cite this