Recent Advances in Constraints: Joint ERCIM / CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2005, Uppsala, Sweden, June 20-22, 2005, Revised Selected and Invited Papers - Lecture Notes in Computer Science 2006 edition

Marc Notes: Based on pre-pub. info. only. Due: 06/06.; Bibl. ref. & index. Table of Contents: Global Constraints.- The All Different and Global Cardinality Constraints on Set, Multiset and Tuple Variables.- Complete Propagation Rules for Lexicographic Order Constraints over Arbitrary Domains.- Among, Common and Disjoint Constraints.- Search and Heuristics.- Partitioning Based Algorithms for Some Colouring Problems.- A CSP Search Algorithm with Reduced Branching Factor.- Analysis of Heuristic Synergies.- Complexity Analysis of Heuristic CSP Search Algorithms.- Language and Implementation Issues.- A Type System for CHR.- Views and Iterators for Generic Constraint Implementations.- Modeling.- A Hybrid Benders Decomposition Method for Solving Stochastic Constraint Programs with Linear Recourse.- The Challenge of Exploiting Weak Symmetries.- On Generators of Random Quasigroup Problems."Publisher Marketing: Constraints are a natural means of knowledge representation. This generality underpins the success with which constraint programming has been applied to a widevarietyofdisciplinesinacademiaandindustrysuchasproductionplanning, communication networks, robotics, and bioinformatics. This volume contains the extended and reviewed version of a selection of papers presented at the Joint ERCIM/CoLogNET International Workshop on Constraint Solving and Constraint Logic Programming (CSCLP 2005), which was held during June 20 22, 2005 in Uppsala, Sweden. It also contains papers that were submitted in response to the open call that followedtheworkshop. Thepapersinthisvolumepresentresearchresultsrega- ing many aspects of constraint solving and constraint logic programming. This includes global constraints, search and heuristics, implementations of constraint systems, and a number of applications. The editors wouldlike to take the opportunity andthank allthe authorswho submitted a paper to this volume, as well as the reviewersfor their helpful work. This volume has been made possible thanks to the support of the European ResearchConsortiumfor Informatics and Mathematics (ERCIM), the European Network on Computational Logic (CoLogNET), the Swedish Institute of C- puter Science (SICS), Science Foundation Ireland (Grant No. 00/PI.1/C075), and the Department of Information Science (DIS) at Uppsala University in Sweden. We hope that the present volume is useful for anyone interested in the recent advancesandnewtrendsinconstraintprogramming, constraintsolving, problem modelling, and applications. March 2006 B. Hnich, M. Carlsson, F. Fages, and F. Rossi Organizers CSCLP 2005 Organization CSCLP 2005 was organized by the ERCIM Working Group on Constraints and the CoLogNET area on Logic and Constraint Logic Programming.

Contributor Bio:  Carlsson, Mats Mats Carlsson is a senior researcher at the Swedish Institute of Computer Science, and is the main author of SICStus Prolog. The development grew as a by-product out of his Ph. D. thesis from the Royal Institute of Technology, Stockholm, 1990 named "Design and Implementation of an OR-Parallel Prolog Engine." Carlsson has wide experience from applications of logic and constraint programming, and is the author of numerous research papers. Contributor Bio:  Rossi, Francesca University of Padova, Italy