Principles and Practice of Constraint Programming - CP 2001 Book

	Hybrid Benders Decomposition Algorithms in Constraint Logic Programming	1
	Branch-and-Check: A Hybrid Framework Integrating Mixed Integer Programming and Constraint Logic Programming	16
	Towards Inductive Constraint Solving	31
	Collaborative Learning for Constraint Solving	46
	Towards Stochastic Constraint Programming: A Study of Online Multi-choice Knapsack with Deadlines	61
	Global Cut Framework for Removing Symmetries	77
	Symmetry Breaking	93
	The Non-existence of (3,1,2)-Conjugate Orthogonal Idempotent Latin Square of Order 10	108
	Random 3-SAT and BDDs: The Plot Thickens Further	121
	Capturing Structure with Satisfiability	137
	Phase Transitions and Backbones of 3-SAT and Maximum 3-SAT	153
	Solving Non-binary CSPs Using the Hidden Variable Encoding	168
	A Filtering Algorithm for the Stretch Constraint	183
	Network Flow Problems in Constraint Programming	196
	Pruning for the Minimum Constraint Family and for the Number of Distinct Values Constraint Family	211
	A Constraint Programming Approach to the Stable Marriage Problem	225
	Components for State Restoration in Tree Search	240
	Adaptive Constraint Handling with CHR in Java	256
	Consistency Maintenance for ABT	271
	Constraint-Based Verification of Client-Server Protocols	286
	A Temporal Concurrent Constraint Programming Calculus	302
	Lower Bounds for Non-binary Constraint Optimization Problems	317
	New Lower Bounds of Constraint Violations for Over-Constrained Problems	332
	A General Scheme for Multiple Lower Bound Computation in Constraint Optimization	346
	Solving Disjunctive Constraints for Interactive Graphical Applications	361
	Sweep as a Generic Pruning Technique Applied to the Non-overlapping Rectangles Constraint	377
	Non-overlapping Constraints between Convex Polytopes	392
	Formal Models of Heavy-Tailed Behavior in Combinatorial Search	408
	The Phase Transition of the Linear Inequalities Problem	422
	In Search of a Phase Transition in the AC-Matching Problem	433
	Specific Filtering Algorithms for Over-Constrained Problems	451
	Specializing Russian Doll Search	464
	A CLP Approach to the Protein Side-Chain Placement Problem	479
	Fast, Constraint-Based Threading of HP-Sequences to Hydrophobic Cores	494
	One Flip per Clock Cycle	509
	Solving Constraints over Floating-Point Numbers	524
	Optimal Pruning in Parametric Differential Equations	539
	Interaction of Constraint Programming and Local Search for Optimisation Problems	554
	Partition-k-AC: An Efficient Filtering Technique Combining Domain Partition and Arc Consistency	560
	Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem	565
	The Expressive Power of Binary Linear Programming	570
	Constraint Generation via Automated Theory Formation	575
	The Traveling Tournament Problem Description and Benchmarks	580
	Deriving Explanations and Implications for Constraint Satisfaction Problems	585
	Generating Tradeoffs for Interactive Constraint-Based Configuration	590
	Structural Constraint-Based Modeling and Reasoning with Basic Configuration Cells	595
	Composition Operators for Constraint Propagation: An Application to Choco	600
	Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination	605
	GAC on Conjunctions of Constraints	610
	Dual Models of Permutation Problems	615
	Boosting Local Search with Artificial Ants	620
	Fast Optimal Instruction Scheduling for Single-Issue Processors with Arbitrary Latencies	625
	Evaluation of Search Heuristics for Embedded System Scheduling Problems	640
	Interpreting Sloppy Stick Figures with Constraint-Based Subgraph Matching	655
	Selecting and Scheduling Observations for Agile Satellites: Some Lessons from the Constraint Reasoning Community Point of View	670
	A Dynamic Distributed Constraint Satisfaction Approach to Resource Allocation	685
	A Constraint Optimization Framework for Mapping a Digital Signal Processing Application onto a Parallel Architecture	701
	iOpt: A Software Toolkit for Heuristic Search Methods	716
	AbsCon: A Prototype to Solve CSPs with Abstraction	730
	A Constraint Engine for Manufacturing Process Planning	745
	On the Dynamic Detection of Interchangeability in Finite Constraint Satisfaction Problems	760
	Automatic Generation of Implied Clauses for SAT	761
	Verification of Infinite-State Systems by Specialization of CLP Programs	762
	Partially Ordered Constraint Optimization Problems	763
	Translations for Comparing Soft Frameworks	764
	Counting Satisfiable k-CNF Formulas	765
	High-Level Modelling and Reformulation of Constraint Satisfaction Problems	766
	Distributed Constraint Satisfaction as a Computational Model of Negotiation via Argumentation	767
	Aircraft Assignment Using Constraint Programming	768
	Labelling Heuristics for CSP Application Domains	769
	Improving SAT Algorithms by Using Search Pruning Techniques	770
	Optimum Symmetry Breaking in CSPs Using Group Theory	771
	Distributed Dynamic Backtracking	772
	Constraint Programming for Distributed Resource Allocation	773
	Exploiting the CSP Structure by Interchangeability	774
	Constraint Processing Techniques for Model-Based Reasoning about Dynamic Systems	776
	Distributed Constraint Satisfaction with Cooperating Asynchronous Solvers	777
	Building Negative Reduced Cost Paths Using Constraint Programming	778
	An Incremental and Non-binary CSP Solver: The Hyperpolyhedron Search Algorithm	779
	Partial Stable Generated Models of Generalized Logic Programs with Constraints	781
	Heterogeneous Constraint Problems (An Outline of the Field of Work)	783
	Comparing SAT Encodings for Model Checking	784
	Asynchronous Search for Numeric DisCSPs	785
	Temporal Concurrent Constraint Programming	786
	Author Index	787