## Principles and Practice of Constraint Programming - CP 2001: 7th International Conference, CP 2001, Paphos, Cyprus, November 26 - December 1, 2001, Proceedings (Google eBook)This book constitutes the refereed proceedings of the 7th International Conference on Principles and Practice of Constraint Programming, CP 2001, held in Paphos, Cyprus, in November/December 2001. The 37 revised full papers, 9 innovative applications presentations, and 14 short papers presented were carefully reviewed and selected from a total of 135 submissions. All current issues in constraint processing are addressed, ranging from theoretical and foundational issues to advanced and innovative applications in a variety of fields. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

1 | |

16 | |

Towards Inductive Constraint Solving | 31 |

Collaborative Learning for Constraint Solving | 46 |

A Study of Online Multichoice Knapsack with Deadlines | 61 |

Global Cut Framework for Removing Symmetries | 77 |

Symmetry Breaking | 93 |

The Nonexistence of 312Conjugate Orthogonal Idempotent Latin Square of Order 10 | 108 |

Deriving Explanations and Implications for Constraint Satisfaction Problems | 585 |

Generating Tradeoffs for Interactive ConstraintBased Configuration | 590 |

Structural ConstraintBased Modeling and Reasoning with Basic Configuration Cells | 595 |

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 |

The Plot Thickens Further | 121 |

Capturing Structure with Satisfiability | 137 |

Weixiong Zhang | 153 |

Solving Nonbinary 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 |

ConstraintBased Verification of ClientServer Protocols | 286 |

A Temporal Concurrent Constraint Programming Calculus | 302 |

Lower Bounds for Nonbinary Constraint Optimization Problems | 317 |

New Lower Bounds of Constraint Violations for OverConst rained 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 Nonoverlapping Rectangles Constraint | 377 |

Nonoverlapping Constraints between Convex Polytopes | 392 |

Formal Models of HeavyTailed Behavior in Combinatorial Search | 408 |

The Phase Transition of the Linear Inequalities Problem | 422 |

In Search of a Phase Transition in the ACMatching Problem | 433 |

Specific Filtering Algorithms for OverConstrained Problems | 451 |

Specializing Russian Doll Search | 464 |

A CLP Approach to the Protein SideChain Placement Problem | 479 |

Fast ConstraintBased Threading of HPSequences to Hydrophobic Cores | 494 |

One Flip per Clock Cycle | 509 |

Solving Constraints over FloatingPoint Numbers | 524 |

Optimal Pruning in Parametric Differential Equations | 539 |

Interaction of Constraint Programming and Local Search for Optimisation Problems | 554 |

An Efficient Filtering Technique Combining Domain Partition and Arc Consistency | 560 |

NeighborhoodBased 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 |

Fast Optimal Instruction Scheduling for SingleIssue Processors with Arbitrary Latencies | 625 |

Evaluation of Search Heuristics for Embedded System Scheduling Problems | 640 |

Interpreting Sloppy Stick Figures with ConstraintBased 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 |

A Software Toolkit for Heuristic Search Methods | 716 |

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 |

761 | |

Verification of InfiniteState Systems by Specialization of CLP Programs | 762 |

Partially Ordered Constraint Optimization Problems | 763 |

764 | |

Counting Satisfiable kCNF Formulas | 765 |

HighLevel Modelling and Reformulation of Constraint Satisfaction Problems | 766 |

767 | |

Aircraft Assignment Using Constraint Programming | 768 |

Labelling Heuristics for CSP Application Domains | 769 |

Improving SAT Algorithms by Using Search Pruning Techniques Ines Lynce and Joao MarquesSilva | 770 |

Optimum Symmetry Breaking in CSPs Using Group Theory | 771 |

Distributed Dynamic Backtracking | 772 |

773 | |

Exploiting the CSP Structure by Interchangeability | 774 |

Constraint Processing Techniques for ModelBased Reasoning about Dynamic Systems | 776 |

Distributed Constraint Satisfaction with Cooperating Asynchronous Solvers | 777 |

Building Negative Reduced Cost Paths Using Constraint Programming | 778 |

The Hyperpolyhedron Search Algorithm | 779 |

781 | |

Heterogeneous Constraint Problems An Outline of the Field of Work | 783 |

784 | |

785 | |

Temporal Concurrent Constraint Programming | 786 |

787 | |

### Common terms and phrases

abstract AC-matching agents application approach arc consistency Artificial Intelligence assignment backtracking Berlin Heidelberg 2001 binary Boolean branching clauses combinatorial complexity Computer configuration consider Constraint Logic Programming constraint programming constraint propagation constraint satisfaction problems corresponding cost CPLEX defined denote density disjunction distributed dynamic efficient encoding evaluation example Figure filtering algorithm formula framework function given global constraints graph GSAT heavy-tailed heuristic hidden variable implementation instances instantiation integer interval iteration linear LNCS Logic Programming lower bound master problem matching MAX 3-SAT maximum method minimal n-queens problem node nogoods non-binary NP-complete operations paper parameter performance phase transition polytope Proc properties proposed protein pruning quasigroup random Regular-SAT ROBDD rotamers satisfied search algorithm search space search tree Section sequence side-chain solving Springer-Verlag Berlin Heidelberg straint strategy structure subproblem symmetries task techniques Theorem tuples variable ordering