Principles and Practice of Constraint Programming - CP97, Vol. 133 Book

	Visual Solver, a Modeling Language for Constraint Programming	1
	Narrowing a 2n-block of Sortings in O(n log n)	2
	Solving Various Weighted Matching Problems with Constraints	17
	A Filtering Algorithm for Global Sequencing Constraints	32
	Semantics and Expressive Power of a Timed Concurrent Constraint Language	47
	Solving Classes of Set Constraints with Tree Automata	62
	The Logic of Search Algorithms: Theory and Applications	77
	Verification of Parallel Systems Using Constraint Programming	92
	Random Constraint Satisfaction: A More Accurate Picture	107
	Heavy-Tailed Distributions in Combinatorial Search	121
	Counting, Structure Identification and Maximum Consistency for Binary Constraint Satisfaction Problems	136
	Statistical Analysis of Backtracking on Inconsistent CSPs	150
	Using Constraint Propagation for Complex Scheduling Problems: Managing Size, Complex Resources and Travel	163
	Understanding and Improving the MAC Algorithm	167
	Modelling Exceptionally Hard Constraint Satisfaction Problems	182
	Tabu Search for Maximal Constraint Satisfaction Problems	196
	Reconfigurable Architectures: A New Vision for Optimization Problems	209
	Distributed Partial Constraint Satisfaction Problem	222
	Localizer: A Modeling Language for Local Search	237
	Operational Semantics and Confluence of Constraint Propagation Rules	252
	AC-Unification of Higher-Order Patterns	267
	On the Complexity of Unification and Disunification in Commutative Idempotent Semigroups	282
	Ordering Constraints over Feature Trees	297
	From Restricted Path Consistency to Max-Restricted Path Consistency	312
	The Constrainedness of Arc Consistency	327
	Look-Ahead Versus Look-Back for Satisfiability Problems	341
	Why Adding More Constraints Makes a Problem Easier for Hill-Climbing Algorithms: Analyzing Landscapes of CSPs	356
	Interval Methods for Non-linear Constraints	371
	Configurable Solvers: Tailoring General Methods to Specific Applications	372
	Constraint Propagation and Decomposition Techniques for Highly Disjunctive and Highly Cumulative Project Scheduling Problems	375
	Five Pitfalls of Empirical Scheduling Research	390
	Bounding the Optimum of Constraint Optimization Problems	405
	GENIUS-CP: A Generic Single-Vehicle Routing Algorithm	420
	Satisfiability of Quantitative Temporal Constraints with Multiple Granularities	435
	Tractable Recursion over Geometric Data	450
	Finding Solvable Subsets of Constraint Graphs	463
	Tractable Disjunctive Constraints	478
	Compiling Constraint Solving Using Projection	491
	Oscillation, Heuristic Ordering and Pruning in Neighborhood Search	506
	Programming Constraint Inference Engines	519
	NeMo+: Object-Oriented Constraint Programming Environment Based on Subdefinite Models	534
	Set Constraints: A Pearl in Research on Constraints	549
	Author Index	563