Advertisement

© 2001

Principles and Practice of Constraint Programming — CP 2001

7th International Conference, CP 2001 Paphos, Cyprus, November 26 – December 1, 2001 Proceedings

  • Toby Walsh
Conference proceedings CP 2001

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2239)

Table of contents

  1. Front Matter
    Pages I-XIV
    PDF
  2. Hybrid Benders Decomposition Algorithms in Constraint Logic Programming
    Andrew Eremin, Mark Wallace
    Pages 1-15
  3. Branch-and-Check: A Hybrid Framework Integrating Mixed Integer Programming and Constraint Logic Programming
    Erlendur S. Thorsteinsson
    Pages 16-30
  4. Towards Inductive Constraint Solving
    Slim Abdennadher, Christophe Rigotti
    Pages 31-45
  5. Collaborative Learning for Constraint Solving
    Susan L. Epstein, Eugene C. Freuder
    Pages 46-60
  6. Towards Stochastic Constraint Programming: A Study of Onine Multi-Choice Knapsack with Deadlines
    Thierry Benoist, Eric Bourreau, Yves Caseau, Benoît Rottembourg
    Pages 61-76
  7. Global Cut Framework for Removing Symmetries
    Filippo Focacci, Michaela Milano
    Pages 77-92
  8. Symmetry Breaking
    Torsten Fahle, Stefan Schamberger, Meinolf Sellmann
    Pages 93-107
  9. The Non-existence of (3,1,2)-Conjugate Orthogonal Idempotent Latin Square of Order 10
    Olivier Dubois, Gilles Dequen
    Pages 108-120
  10. Random 3-SAT and BDDs: The Plot Thickens Further
    Alfonso San Miguel Aguirre, MosheY. Vardi
    Pages 121-136
  11. Capturing Structure with Satisfiability
    Ramón Béjar, Alba Cabiscol, Cèsar Fernàndez, Felip Manyà, Carla Gomes
    Pages 137-152
  12. Phase Transitions and Backbones of 3-SAT and Maximum 3-SAT
    Weixiong Zhang
    Pages 153-167
  13. Solving Non-binary CSPs Using the Hidden Variable Encoding
    Nikos Mamoulis, Kostas Stergiou
    Pages 168-182
  14. A Filtering Algorithm for the Stretch Constraint
    Gilles Pesant
    Pages 183-195
  15. Network Flow Problems in Constraint Programming
    Alexander Bockmayr, Nicolai Pisaruk, Abderrahmane Aggoun
    Pages 196-210
  16. Pruning for the Minimum Constraint Family and for the Number of Distinct Values Constraint Family
    Nicolas Beldiceanu
    Pages 211-224
  17. A Constraint Programming Approach to the Stable Marriage Problem
    Ian P. Gent, Robert W. Irving, David F. Manlove, Patrick Prosser, Barbara M. Smith
    Pages 225-239
  18. Components for State Restoration in Tree Search
    Chiu Wo Choi, Martin Henz, Ka Boon Ng
    Pages 240-255
  19. Adaptive Constraint Handling with CHR in Java
    Armin Wolf
    Pages 256-270
  20. Consistency Maintenance for ABT
    Marius-Călin Silaghi, Djamila Sam-Haroud, Boi Faltings
    Pages 271-285
  21. Constraint-Based Verification of Client-Server Protocols
    Giorgio Delzanno, Tevfik Bultan
    Pages 286-301
  22. A Temporal Concurrent Constraint Programming Calculus
    Catuscia Palamidessi, Frank D. Valencia
    Pages 302-316
  23. Lower Bounds for Non-binary Constraint Optimization Problems
    Pedro Meseguer, Javier Larrosa, Martí Sánchez
    Pages 317-331
  24. New Lower Bounds of Constraint Violations for Over-Constrained Problems
    Jean-Charles Régin, Thierry Petit, Christian Bessière, Jean-François Puget
    Pages 332-345
  25. A General Scheme for Multiple Lower Bound Computation in Constraint Optimization
    Rina Dechter, Kalev Kask, Javier Larrosa
    Pages 346-360
  26. Solving Disjunctive Constraints for Interactive Graphical Applications
    Kim Marriott, Peter Moulder, Peter J. Stuckey, Alan Borning
    Pages 361-376
  27. Sweep as a Generic Pruning Technique Applied to the Non-overlapping Rectangles Constraint
    Nicolas Beldiceanu, Mats Carlsson
    Pages 377-391
  28. Non-overlapping Constraints between Convex Polytopes
    Nicolas Beldiceanu, Qi Guo, Sven Thiel
    Pages 392-407
  29. Formal Models of Heavy-Tailed Behavior in Combinatorial Search
    Hubie Chen, Carla Gomes, Bart Selman
    Pages 408-421
  30. The Phase Transition of the Linear Inequalities Problem
    Alessandro Armando, Felice Peccia, Silvio Ranise
    Pages 422-432
  31. In Search of a Phase Transition in the AC-Matching Problem
    Phokion G. Kolaitis, Thomas Raffill
    Pages 433-450
  32. Specific Filtering Algorithms for Over-Constrained Problems
    Thierry Petit, Jean-Charles Régin, Christian Bessière
    Pages 451-463
  33. Specializing Russian Doll Search
    Pedro Meseguer, Martì Sánchez
    Pages 464-478
  34. A CLP Approach to the Protein Side-Chain Placement Problem
    Martin T. Swain, Graham J. L. Kemp
    Pages 479-493
  35. Fast, Constraint-Based Threading of HP-Sequences to Hydrophobic Cores
    Rolf Backofen, Sebastian Will
    Pages 494-508
  36. One Flip per Clock Cycle
    Martin Henz, Edgar Tan, Roland Yap
    Pages 509-523
  37. Solving Constraints over Floating-Point Numbers
    C. Michel, M. Rueher, Y. Lebbah
    Pages 524-538
  38. Optimal Pruning in Parametric Differential Equations
    Micha Janssen, Pascal Van Hentenryck, Yves Deville
    Pages 539-553
  39. Interaction of Constraint Programming and Local Search for Optimisation Problems
    Francisco Azevedo, Pedro Barahona
    Pages 554-559
  40. Partition-k-AC: An Efficient Filtering Technique Combining Domain Partition and Arc Consistency
    Hachemi Bennaceur, Mohamed-Salah Affane
    Pages 560-564
  41. Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem
    Christian Bessiére, Assef Chmeiss, Lakhdar Saïs
    Pages 565-569
  42. The Expressive Power of Binary Linear Programming
    Marco Cadoli
    Pages 570-574
  43. Constraint Generation via Automated Theory Formation
    Simon Colton, Ian Miguel
    Pages 575-579
  44. The Traveling Tournament Problem Description and Benchmarks
    Kelly Easton, George Nemhauser, Michael Trick
    Pages 580-584
  45. Deriving Explanations and Implications for Constraint Satisfaction Problems
    Freuder Eugene C., Chavalit Likitvivatanavong, Wallace Richard J.
    Pages 585-589
  46. Generating Tradeoffs for Interactive Constraint-Based Configuration
    Freuder Eugene C., Barry O’Sullivan
    Pages 590-594
  47. Structural Constraint-Based Modeling and Reasoning with Basic Configuration Cells
    Gasca Rafael M., Ortega Juan A., Miguel Toro
    Pages 595-599
  48. Composition Operators for Constraint Propagation:An Application to Choco
    Laurent Granvilliers, Eric Monfroy
    Pages 600-604
  49. Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination
    Hirsch Edward A., Arist Kojevnikov
    Pages 605-609
  50. GAC on Conjunctions of Constraints
    George Katsirelos, Fahiem Bacchus
    Pages 610-614

About these proceedings

Introduction

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.

Keywords

3-SAT Adaptive Constraint Handling Constraint Programming Constraint Propagation Interval Constraints Java Set Constraints Timetabling algorithm algorithms logic model checking modeling optimization programming

Editors and affiliations

  • Toby Walsh
    • 1
  1. 1.Department of Computer ScienceThe University of YorkHeslingtonUK

Bibliographic information

Industry Sectors
Pharma
Automotive
Chemical Manufacturing
Biotechnology
IT & Software
Telecommunications
Engineering
Finance, Business & Banking
Electronics
Energy, Utilities & Environment
Aerospace