A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
On Hybridization of Local Search and Constraint Propagation
[chapter]
2004
Lecture Notes in Computer Science
Hybridization of local search and constraint programming techniques for solving Constraint Satisfaction Problems is generally restricted to some kind of master-slave combinations for specific classes of problems. In this paper we propose a theoretical model based on K.R. Apt's chaotic iterations for hybridization of local search and constraint propagation. Hybrid resolution can be achieved as the computation of a fixpoint of some specific reduction functions. Our framework opens up new and
doi:10.1007/978-3-540-27775-0_21
fatcat:vs52zp4qfzag7heczi62cqhucm