Principles and Practice of Constraint Programming - CP 2001约束编程原理与实践－CP 2001

The LNCS series reports state-of-the-art results in computer science research, development, and education, at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community,with numerous individuals, as well as with prestigious organizations and　societies, LNCS has grown into the most comprehensive computer science research forum available.
The scope of LNCS, including its subseries LNAI, spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields. The type of material published traditionally includes
- proceedings (published in time for the respective conference)
- post-proceedings (consisting of thoroughly revised final full papers)
- research m0nographs (which may be based on outstanding PhD work,research projects, technical reports, etc.)

Hybrid Benders Decomposition A]gorithms　in Constraint Logic Programming
Andrew Eremin, Mark Wallace
Branch-and-Check: A Hybrid Framework Integrating Mixed　Integer Programming and Constraint Logic Programming
Erlendur S. Thorsteinsson
Towards Inductive Constraint Solving
Slim Abdennadher, Christophe Rigotti
Collaborative Learning for Constraint Solving
Susan L. Epstein, Eugene C. Freuder
Towards Stochastic Constraint Programming:　A Study of Online Multi-choice Knapsack with Deadlines
Thierry Benoist, Eric Bourreau, Yves Caseau, Benoit Rottembourg
Global Cut Framework for Removing Symmetries
Filippo Focacci, Michaela Milano
Symmetry Breaking
Torsten Fahle, Stefan Schamberger, Meinolf Sellmann
The Non-existence of (3,1,2)-Conjugate Orthogonal Idempotent　Latin Square of Order 10
Olivier Dubois, Gilles Dequen
Random 3-SAT and BDDs: The Plot Thickens Further
Alfonso San Miguel Aguirre, Moshe Y. Vardi
Capturing Structure with Satisfiability
RamSn Bejar, Alba Cabiscol, Cesar Fernandez, Felip Manya,Carla Gomes
Phase Transitions and Backbones of 3-SAT and Maximum 3-SAT
Weixiong Zhang
Solving Non-binary CSPs Using the Hidden Variable Encoding
Nikos Mamoulis, Kostas Stergiou
A Filtering Algorithm for the Stretch Constraint
Gilles Pesant
Network Flow Problems in Constraint Programming
Alexander Bockmayr, Nicolai Pisaruk, Abderrahmane Aggoun
Pruning for the Minimum Constraint Family and for　the Number of Distinct Values Constraint Family
Nicolas Beldiceanu
A Constraint Programming Approach to the Stable Marriage Problem
Ian P. Gent, Robert W. Irving, David F. Manlove, Patrick Prosser,Barbara M. Smith
Components for State Restoration in Tree Search
Chiu Wo Choi, Martin Henz, Ka Boon Ng
Adaptive Constraint Handling with CHR in Java
　Armin Wolf
Consistency Maintenance for ABT
　Marius-Calin Silaghi, Djamila Sam-Haroud, Boi Faltings
Constraint-Based Verification of Client-Server Protocols
Giorgio Delzanno, Tevfik Bultan
A Temporal Concurrent Constraint Programming Calculus
Catuscia Palamidessi, Frank D. Valencia
Lower Bounds for Non-binary Constraint Optimization Problems
Pedro Meseguer, Javier Larrosa, Marti Sdnchez
New Lower Bounds of Constraint Violations　for Over-Constrained Problems
　Jean-Charles Regin, Thier'ry Petit, Christian Bessi~re,Jean_Francois Puget
A General Scheme for Multiple Lower Bound Computation in　Constraint Optimization
　Rina Dechter, Kalev Kask, Javier Larrosa
Solving Disjunctive Constraints for Interactive Graphical Applications
Kim Marriott, Peter Moulder, Peter J. Stuckey, Alan Borning
Sweep as a Generic Pruning Technique Applied to　the Non-overlapping Rectangles Constraint
Nicolas Beldiceanu, Mats Carlsson
Non-overlapping Constraints between Convex Polytopes
　Nicolas Beldiceanu, Qi Guo, Sven Thiel
Formal Models of Heavy-Tailed Behavior in Combinatorial Search
　Hubie Chen, Carla Gomes, Bart Selman
……
Author Index