The proceedings contain 11 papers. The topics discussed include: hybrid algorithms in constrained programming; an attempt to dynamically break symmetries in the social golfers problem; a constraint model for state transitions in disjunctive resources; reusing CSP propagators for QCSPs; bipolar preference problems: framework, properties and solving techniques; distributed forward checking may lie for privacy; solving first-order constraints in the theory of the evaluated trees; extracting microstructure in binary constraint networks; complexity of a CHR solver for existentially quantifies conjunctions of equations over trees; efficient recognition of acrylic clustered constraint satisfaction problems; and cost-based filtering for stochastic inventory control.
|Place of Publication||Berlin|
|Number of pages||183|
|Publication status||Published - 2007|
|Event||11th Annual European Research Consortium for Informatics and Mathematics (ERCIM) International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2006 - Caparica, Portugal|
Duration: 26 Jun 2006 → 26 Jun 2006
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|