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