Local search as a fixed point of functions

Eric Monfroy, Frédéric Saubion, Broderick Crawford, Carlos Castro

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

Abstract

Constraint Satisfaction Problems (CSP) provide a general framework for modeling many practical applications (planning, scheduling, time tabling, ...). CSPs can be solved with complete methods (e.g., constraint propagation), or incomplete methods (e.g., local search). Although there are some frameworks to formalize constraint propagation, there are only few studies of theoretical frameworks for local search. Here we are concerned with the design and use of a generic framework to model local search as the computation of a fixed point of functions.

Original languageEnglish
Title of host publicationICEIS 2008 - Proceedings of the 10th International Conference on Enterprise Information Systems
Pages431-434
Number of pages4
StatePublished - 2008
Externally publishedYes
EventICEIS 2008 - 10th International Conference on Enterprise Information Systems - Barcelona, Spain
Duration: 12 Jun 200816 Jun 2008

Publication series

NameICEIS 2008 - Proceedings of the 10th International Conference on Enterprise Information Systems
VolumeAIDSS

Conference

ConferenceICEIS 2008 - 10th International Conference on Enterprise Information Systems
Country/TerritorySpain
CityBarcelona
Period12/06/0816/06/08

Keywords

  • Constraint Satisfaction Problems (CSP)
  • Constraint solving
  • Local search

Fingerprint

Dive into the research topics of 'Local search as a fixed point of functions'. Together they form a unique fingerprint.

Cite this