| On Confluence of Constraint Handling Rules | p. 1 |
| A Labelling Arc Consistency Method for Functional Constraints | p. 16 |
| Constraint Satisfaction in Optical Routing for Passive Wavelength-Routed Networks | p. 31 |
| Using CSP Look-Back Techniques to Solve Exceptionally Hard SAT Instances | p. 46 |
| MAC and Combined Heuristics: Two Reasons to Forsake FC (and CBJ?) on Hard Problems | p. 61 |
| The Independence Property of a Class of Set Constraints | p. 76 |
| Speeding Up Constraint Propagation by Redundant Modeling | p. 91 |
| A Constraint-Based Interactive Train Rescheduling Tool | p. 104 |
| Local Search and the Number of Solutions | p. 119 |
| Derivation of Constraints and Database Relations | p. 134 |
| Constraint Programming: An Efficient and Practical Approach to Solving the Job-Shop Problem | p. 149 |
| An Instance of Adaptive Constraint Propagation | p. 164 |
| An Empirical Study of Dynamic Variable Ordering Heuristics for the Constraint Satisfaction Problem | p. 179 |
| Empirical Studies of Heuristic Local Search for Constraint Solving | p. 194 |
| Defeasibility in CLP(Q) through Generalized Slack Variables | p. 209 |
| Inference Duality as a Basis for Sensitivity Analysis | p. 224 |
| Generalized Local Propagation: A Framework for Solving Constraint Hierarchies | p. 237 |
| Transformations Between HCLP and PCSP | p. 252 |
| A Test for Tractability | p. 267 |
| Combination of Constraint Systems II: Rational Amalgamation | p. 282 |
| Tractable Disjunctions of Linear Constraints | p. 297 |
| Exploiting the Use of DAC in MAX-CSP | p. 308 |
| A New Approach for Weighted Constraint Satisfaction: Theoretical and Computational Results | p. 323 |
| Towards a More Efficient Stochastic Constraint Solver | p. 338 |
| A View of Local Search in Constraint Programming | p. 353 |
| From Quasi-Solutions to Solution: An Evolutionary Algorithm to Solve CSP | p. 367 |
| Existential Variables and Local Consistency in Finite Domain Constraint Problems | p. 382 |
| Logical Semantics of Concurrent Constraint Programming | p. 397 |
| Solving Non-Binary Convex CSPs in Continuous Domains | p. 410 |
| An Experimental Comparison of Three Modified DeltaBlue Algorithms | p. 425 |
| Constraint Logic Programming over Unions of Constraint Theories | p. 436 |
| Analysis of Hybrid Systems in CLP(R) | p. 451 |
| On Query Languages for Linear Queries Definable with Polynomial Constraints | p. 468 |
| Analysis of Heuristic Methods for Partial Constraint Satisfaction Problems | p. 482 |
| Solving Satisfiability Problems Using Field Programmable Gate Arrays: First Results | p. 497 |
| A Constraint Program for Solving the Job-Shop Problem | p. 510 |
| PSAP - A Planning System for Aircraft Production | p. 525 |
| Using Partial Arc Consistency in a Database Environment | p. 527 |
| Functional Constraint Hierarchies in CLP | p. 529 |
| Towards an Open Finite Domain Constraint Solver | p. 531 |
| Efficient Constraint Propagation with Good Space Complexity | p. 533 |
| Anytime Temporal Reasoning: Preliminary Report | p. 535 |
| From Constraint Minimization to Goal Optimization in CLP Languages | p. 537 |
| Looking at Full Looking Ahead | p. 539 |
| The Arc and Path Consistency Phase Transitions | p. 541 |
| Experiences with Combining Constraint Programming and Discrete Event Simulation | p. 543 |
| Hill-Climbing with Local Consistency for Solving Distributed CSPs | p. 545 |
| Approximate Algorithms for Maximum Utility Problems | p. 547 |
| A Meta Constraint Logic Programming Architecture | p. 549 |
| N-Ary Consistencies and Constraint-Based Backtracking | p. 551 |
| Global Behaviour for Complex Constraints | p. 553 |
| To Guess or to Think? Hybrid Algorithms for SAT | p. 555 |
| A Local Simplification Scheme for cc Programs | p. 557 |
| From Evaluating Upper Bounds of the Complexity of Solving CSPs to Finding All the Solutions of CSPs | p. 559 |
| Modeling and Solving Distributed Constraint Satisfaction Problems (DCSPs) | p. 561 |
| Scheduling an Asynchronously Shared Resource | p. 563 |
| The Generalized Railroad Crossing: Its Symbolic Analysis in CLP(R) | p. 565 |
| A Stochastic Approach to Solving Fuzzy Constraint Satisfaction Problems | p. 568 |
| Branch-and-Price for Solving Integer Programs with a Huge Number of Variables: Methods and Applications | p. 570 |
| Constraint Databases | p. 571 |
| Complexity-Theoretic Aspects of Programming Language Design | p. 572 |
| Author Index | p. 573 |
| Table of Contents provided by Blackwell. All Rights Reserved. |