Principles and Practice of Constraint Programming - CP 2010

1. Front Matter

   PDF

2. Invited Talks

   1. SAT Modulo Theories: Getting the Best of SAT and Global Constraint Filtering

      • Robert Nieuwenhuis

      Pages 1-2

   2. Constraint-Directed Search in Computational Finance and Economics

      • Edward Tsang

      Pages 3-7

   3. Constraints, Graphs, Algebra, Logic, and Complexity

      • Moshe Y. Vardi

      Pages 8-8

3. Distinguished Papers

   1. Testing Expressibility Is Hard

      • Ross Willard

      Pages 9-23

   2. Applying Constraint Programming to Identification and Assignment of Service Professionals

      • Sigal Asaf, Haggai Eran, Yossi Richter, Daniel P. Connors, Donna L. Gresh, Julio Ortega et al.

      Pages 24-37

   3. Computing the Density of States of Boolean Formulas

      • Stefano Ermon, Carla P. Gomes, Bart Selman

      Pages 38-52

4. Research Track

   1. Towards Parallel Non Serial Dynamic Programming for Solving Hard Weighted CSP

      • David Allouche, Simon de Givry, Thomas Schiex

      Pages 53-60

   2. Making Adaptive an Interval Constraint Propagation Algorithm Exploiting Monotonicity

      • Ignacio Araya, Gilles Trombettoni, Bertrand Neveu

      Pages 61-68

   3. Improving the Performance of maxRPC

      • Thanasis Balafoutis, Anastasia Paparrizou, Kostas Stergiou, Toby Walsh

      Pages 69-83

   4. Checking-Up on Branch-and-Check

      • J. Christopher Beck

      Pages 84-98

   5. Spatial, Temporal, and Hybrid Decompositions for Large-Scale Vehicle Routing with Time Windows

      • Russell Bent, Pascal Van Hentenryck

      Pages 99-113

   6. Decomposition of the NValue Constraint

      • Christian Bessiere, George Katsirelos, Nina Narodytska, Claude-Guy Quimper, Toby Walsh

      Pages 114-128

   7. Propagating the Bin Packing Constraint Using Linear Programming

      • Hadrien Cambazard, Barry O’Sullivan

      Pages 129-136

   8. Sweeping with Continuous Domains

      • Gilles Chabert, Nicolas Beldiceanu

      Pages 137-151

   9. A New Hybrid Tractable Class of Soft Constraint Problems

      • Martin C. Cooper, Stanislav Živný

      Pages 152-166

   10. A Propagator for Maximum Weight String Alignment with Arbitrary Pairwise Dependencies

       • Alessandro Dal Palù, Mathias Möhl, Sebastian Will

       Pages 167-175

   11. Using Learnt Clauses in maxsat

       • Jessica Davies, Jeremy Cho, Fahiem Bacchus

       Pages 176-190

   12. Domain Consistency with Forbidden Values

       • Yves Deville, Pascal Van Hentenryck

       Pages 191-205

   13. Generating Special-Purpose Stateless Propagators for Arbitrary Constraints

       • Ian P. Gent, Chris Jefferson, Ian Miguel, Peter Nightingale

       Pages 206-220

The 16th annual International Conference on the Principles and Practice of Constraint Programming (CP 2010) was held in St. Andrews, Scotland, during September 6–10, 2010. We would like to thank our sponsors for their generous support of this event. This conference is concerned with all aspects of computing with constraints, including:theory,algorithms,applications,environments,languages,modelsand systems. We received a wide variety of submissions, each of which was reviewed by at least three referees. Referees were chosen for each submission by an initial bidding process where Program Committee members chose papers from their area of interest. The range of expertise represented by the large Program C- mittee meant that almost all submissions were reviewed by subject experts on the Program Committee, or by colleagues chosen by members of the Program Committee for their particular expertise. Papers weresolicitedeither as long (15 page), or short (8 page) submissions. Short-paper submissions were refereed to exactly the same high standards as long-paper submissions but naturally were expected to contain a smaller quantity of new material. Thus there is no disti- tion in these proceedings between short and long papers. I used the excellent EasyChair conference management system to support this process of reviewing, and for the collation and organization of these proceedings. Submissions were made either to the applications track or to the research track. Therewere101(23short)researchtracksubmissionsofwhich36(8short) wereaccepted,whichisa36%(35%ofshort)acceptancerate. Applicationstrack submissions received special consideration and the acceptance rate was sign- cantly higher than for the research track.

• Constraint
• Ontologie
• Programming language A
• algorithms
• expert system
• modeling
• multimedia
• optimization
• programming language
• semantic web
• algorithm analysis and problem complexity

• Department of Computer Science, Royal Holloway, University of London, Surrey, United Kingdom

  David Cohen

Policies and ethics