This book constitutes the thoroughly refereed and extended post-proceedings of the Joint ERCIM/CoLogNet International Workshop on Constraint Solving and Constraint Logic Programming， CSCLP 2005， held in Uppsala， Sweden in June 2005. Besides papers taken from the workshop， others are submitted in response to an open call for papers after the workshop. The 12 revised full papers presented were carefully reviewed and selected for inclusion in the book. The papers are organized in topical sections on global constraints， search and heuristics， language and implementation issues， and modeling.
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 Bender's Decomposition Method for Solving Stochastic Constraint Programs with Linear Recourse The Challenge of Exploiting Weak Symmetries On Generators of Random Quasigroup Problems Author Index
鄂公網(wǎng)安備 42010302001612號(hào) 