§16§The 11th International Conference on the Principles and Practice of Constraint Programming (CP 2005) was held in Sitges (Barcelona), Spain, October 1 5, 2005. Information about the conference can be found on the web at series can be found atThe CP conference series is the premier international conference on c- straint programming and is held annually. The conference is concerned with all aspects of computing with constraints, including: algorithms, applications, environments, languages, models and systems. This year, we received 164 submissions. All of the submitted papers received atleastthreereviews,andthepapersandtheirreviewswerethenextensivelyd- cussed during an online Program Committee meeting. As a result, the Program Committee chose 48 (29.3%) papers to be published in full in the proceedings and a further 22 (13.4%)papers to be published as short papers.The full papers werepresentedattheconferencein twoparalleltracksandtheshortpaperswere presented as posters during a livel §16§y evening session. Two papers were selected by a subcommittee of the ProgramCommittee consisting of Chris Beck, Gilles Pesant, and myself to receive best paper awards. The conference program also includedexcellentinvitedtalksbyH ectorGe?ner,IanHorrocks,FrancescaRossi, and Peter J. Stuckey. As a permanent record, the proceedings contain four-page extended abstracts of the invited talks. §04§Invited Papers.- Best Papers.- Full Papers.- Short Papers.- Doctoral Papers.- System Demonstrations. §04§ad Saturation with Restriction for SAT.- Evolving Variable-Ordering Heuristics for Constrained Optimisation.- Multi-point Constructive Search.- Bounds of Graph Characteristics.- Acquiring Parameters of Implied Global Constraints.- Integrating Benders Decomposition Within Constraint Programming.- Using Boolean Constraint Propagation for Sub-clauses Deduction.- Extending Systematic Local Search for Job Shop Scheduling Problems.- Interactive Reconfiguration in Power Supply Restoration.- Neighbourhood Clause Weight Redistribution in Local Search for SAT.- Computing and Exploiting Tree-Decompositions for Solving Constraint Networks.- Encoding Requests to Web Service Compositions as Constraints.- Test Instance Generation for MAX 2SAT.- Consistency for Quantified Constraint Satisfaction Problems.- Alternate Modeling in Sport Scheduling.- Approximations in Distributed Optimization.- Extremal CSPs.- Beyond Finite Domains: The All Different and Global Cardinality Constraints.- Views and Ite §04§rators for Generic Constraint Implementations.- Approximated Consistency for the Automatic Recording Problem.- Towards an Optimal CNF Encoding of Boolean Cardinality Constraints.- Approximate Constrained Subgraph Matching.- Doctoral Papers.- Distributed Constraints for Large-Scale Scheduling Problems.- Solving Over-Constrained Problems with SAT.- A Constraint Based Agent for TAC-SCM.- Solving the Car-Sequencing Problem as a Non-binary CSP.- Dimensioning an Inbound Call Center Using Constraint Programming.- Methods to Learn Abstract Scheduling Models.- Automated Search for Heuristic Functions.- Constraint-Based Inference: A Bridge Between Constraint Processing and Probability Inference.- Scheduling Social Tournaments.- Domain Reduction for the Circuit Constraint.- Using Constraint Programming for Solving Distance CSP with Uncertainty.- Improved Algorithm for Finding (a,b)-Super Solutions.- Local Consistency in Weighted CSPs and Inference in Max-SAT.- Modeling Constraint Programs wi
