Principles and Practice of Constraint Programming - CP 2001: 7th International Conference, CP 2001, Paphos, Cyprus, November 26 - December 1, 2001, Pr [Paperback]

This book constitutes the refereed proceedings of the 7th International Conference on Principles and Practice of Constraint Programming, CP 2001, held in Paphos, Cyprus, in November/December 2001.
The 37 revised full papers, 9 innovative applications presentations, and 14 short papers presented were carefully reviewed and selected from a total of 135 submissions. All current issues in constraint processing are addressed, ranging from theoretical and foundational issues to advanced and innovative applications in a variety of fields.Hybrid Benders Decomposition Algorithms in Constraint Logic Programming.- Branch-and-Check: A Hybrid Framework Integrating Mixed Integer Programming and Constraint Logic Programming.- Towards Inductive Constraint Solving.- Collaborative Learning for Constraint Solving.- Towards Stochastic Constraint Programming: A Study of Onine Multi-Choice Knapsack with Deadlines.- Global Cut Framework for Removing Symmetries.- Symmetry Breaking.- The Non-existence of (3,1,2)-Conjugate Orthogonal Idempotent Latin Square of Order 10.- Random 3-SAT and BDDs: The Plot Thickens Further.- Capturing Structure with Satisfiability.- Phase Transitions and Backbones of 3-SAT and Maximum 3-SAT.- Solving Non-binary CSPs Using the Hidden Variable Encoding.- A Filtering Algorithm for the Stretch Constraint.- Network Flow Problems in Constraint Programming.- Pruning for the Minimum Constraint Family and for the Number of Distinct Values Constraint Family.- A Constraint Programming Approach to the Stable Marriage Problem.- Components for State Restoration in Tree Search.- Adaptive Constraint Handling with CHR in Java.- Consistency Maintenance for ABT.- Constraint-Based Verification of Client-Server Protocols.- A Temporal Concurrent Constraint Programming Calculus.- Lower Bounds for Non-binary Constraint Optimization Problems.- New Lower Bounds of Constraint Violations for Over-Constrained Problems.- A General Scheme for Multiple Lower Bound Computation in Constlã¥