cp 2011
17th International Conference on Principles and Practice of
Constraint Programming
To be held in Perugia, Italy from 12-16th September 2011
City of Perugia, Italy


LNCS 6876 is now available online. You can find information about it on the Springer website or you can access the online version.

Lecture Notes in Computer Science 6876
Commenced Publication in 1973

Founding and Former Series Editors:
Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen

Jimmy Lee (Ed.)
Principles and Practice of Constraint Programming – CP 2011
17th International Conference, CP 2011
Perugia, Italy, September 12-16, 2011 Proceedings

Editorial Board
- David Hutchison [Lancaster University, UK]
- Takeo Kanade [Carnegie Mellon University, Pittsburgh, PA, USA]
- Josef Kittler [University of Surrey, Guildford, UK ]
- Jon M. Kleinberg [Cornell University, Ithaca, NY, USA]
- Alfred Kobsa [University of California, Irvine, CA, USA]
- Friedemann Mattern [ETH Zurich, Switzerland]
- John C. Mitchell [Stanford University, CA, USA]
- Moni Naor [Weizmann Institute of Science, Rehovot, Israel]
- Oscar Nierstrasz [University of Bern, Switzerland]
- C. Pandu Rangan [Indian Institute of Technology, Madras, India]
- Bernhard Steffen [TU Dortmund University, Germany]
- Madhu Sudan [Microsoft Research, Cambridge, MA, USA]
- Demetri Terzopoulos [University of California, Los Angeles, CA, USA]
- Doug Tygar [University of California, Berkeley, CA, USA]
- Gerhard Weikum [Max Planck Institute for Informatics, Saarbruecken, Germany]

Volume Editor
Jimmy Lee
The Chinese University of Hong Kong
Department of Computer Science and Engineering
Shatin, N.T., Hong Kong, China
E-mail: jlee[at]cse.cuhk.edu.hk

ISSN 0302-9743 e-ISSN 1611-3349
ISBN 978-3-642-23785-0 e-ISBN 978-3-642-23786-7
DOI 10.1007/978-3-642-23786-7
Springer Heidelberg Dordrecht London NewYork
Library of Congress Control Number: 2011935460
CR Subject Classification (1998): F.4.1, F.2, F.3, G.2, F.1, E.1
LNCS Sublibrary: SL 2 – Programming and Software Engineering

Accepted Papers

  1. Barnaby Martin. QCSP on partially reflexive forests
  2. Justin Yip and Pascal Van Hentenryck. Checking and Filtering Global Set Constraints
  3. Siddhartha Jain and Pascal Van Hentenryck. Large Neighborhood Search for the Dial-a-ride Problem
  4. Amit Metodi, Michael Codish, Vitaly Lagoon and Peter Stuckey. Boolean Equi-propagation for Optimized SAT Encoding
  5. Andreas Schutt, Peter J. Stuckey and Andrew R. Verden. Optimal Carpet Cutting
  6. Tom Schrijvers, Guido Tack, Pieter Wuille, Horst Samulowitz and Peter Stuckey. Search Combinators
  7. Peter Jonsson, Fredrik Kuivinen and Johan Thapper. Min CSP on Four Elements: Moving Beyond Submodularity
  8. Georg Gottlob. On Minimal Constraint Networks
  9. Deepak Mehta, Barry O'Sullivan and Luis Quesada. Value Ordering for Finding All Solutions: Interactions with Adaptive Variable Ordering
  10. Tenda Okimoto, Yongjoon Joe, Atsushi Iwasaki, Makoto Yokoo and Boi Faltings. Pseudo-tree-based Incomplete Algorithm for Distributed Constraint Optimization with Quality Bounds
  11. Christopher Mears, Todd Niven, Marcel Jackson and Mark Wallace. Proving Symmetries by Model Transformation
  12. Weiming Liu, Shengsheng Wang and Sanjiang Li. Qualitative Constraint Solving Involving Landmarks
  13. Thibaut Feydy, Zoltan Somogyi and Peter Stuckey. Half Reification and Flattening
  14. Vianney Le Clément De Saint-Marcq, Yves Deville and Christine Solnon. An Efficient Light Solver for Querying the Semantic Web
  15. Nic Wilson and Walid Trabelsi. Pruning Rules for Constrained Optimisation for Conditional Preferences
  16. Antti Hyvärinen, Tommi Junttila and Ilkka Niemelä. Grid-Based SAT Solving with Iterative Partitioning and Clause Learning
  17. Cédric Pralet and Gérard Verfaillie. Beyond QCSP for solving control problems
  18. Serge Gaspers and Stefan Szeider. The Parameterized Complexity of Local Consistency
  19. Jean-François Condotta and Christophe Lecoutre. Decision-based Consistencies
  20. Gérard Verfaillie and Cédric Pralet. Constraint Programming for Controller Synthesis
  21. Jinsong Guo, Zhanshan Li, Liang Zhang and Xuena Geng. maxRPC algorithms based on bitwise operations
  22. Fabien Hermenier, Sophie Demassey and Xavier Lorca. Bin Repacking Scheduling in Virtualized Datacenters
  23. Martin C. Cooper and Stanislav Zivny. Tractable triangles
  24. Martin C. Cooper and Stanislav Zivny. Hierarchically nested convex VCSP
  25. Paidi Creed and Stanislav Zivny. On Minimal Weighted Clones
  26. Nicolas Beldiceanu and Helmut Simonis. A Constraint Seeker: Finding and Ranking Global Constraints from Examples
  27. Serdar Kadioglu, Eoin O'Mahony, Philippe Refalo and Meinolf Sellmann. Optimism Pays Off: Incorporating Variance in Impact-Based Search
  28. Serdar Kadioglu, Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz and Meinolf Sellmann. Algorithm Selection and Scheduling
  29. Tivadar Papai, Parag Singla and Henry Kautz. Constraint Propagation for Efficient Inference in Markov Logic
  30. Allen Van Gelder. Variable Independence and Resolution Paths for Quantified Boolean Formulas
  31. M.A.Hakim Newton, Duc-Nghia Pham, Abdul Sattar and Michael Maher. Kangaroo: An Efficient Constraint-Based Local Search System Using Lazy Propagation
  32. Jean Marie Lagniez, Bertrand Mazure and Eric Gregoire. A CSP algorithm focusing on FAC variables
  33. Thierry Petit, Jean-Charles Régin and Nicolas Beldiceanu. A $\Theta$(n) Bound-Consistency Algorithm for the Increasing Sum Constraint
  34. Jean-Guillaume Fages and Xavier Lorca. Revisiting the tree Constraint
  35. Alexis De Clercq, Thierry Petit, Nicolas Beldiceanu and Narendra Jussien. Filtering Algorithms for Discrete Cumulative Problems with Over-loads of Resource
  36. Marie Pelleau, Charlotte Truchet and Frederic Benhamou. Octagonal Domains for Continuous constraints
  37. Alexandre Goldsztejn, Christophe Jermann, Vicente Ruiz De Angulo and Carme Torras. Symmetry Breaking in Numeric Constraint Problems
  38. Roger Kameugne, Laure Pauline Fotso, Joseph Scott and Youcheu Ngo-Kateu. A Quadratic Edge-Finding Filtering Algorithm for Cumulative Resource Constraints
  39. Toshihiro Matsui, Marius Silaghi, Katsutoshi Hirayama, Makoto Yokoo, Boi Faltings and Hiroshi Matsuo. Reducing the Search Space of Resource Constrained DCOPs
  40. Diarmuid Grimes and Emmanuel Hebrard. Models and Strategies for Variants of the Job Shop Scheduling Problem
  41. Samba Ndojh Ndiaye and Christine Solnon. CP Models for Maximum Common Subgraph Problems
  42. Alessio Bonfietti, Michele Lombardi, Michela Milano and Luca Benini. A constraint based approach to cyclic RCPSP
  43. Runming Lu, Sheng Liu and Jian Zhang. Searching for Doubly Self-Orthogonal Latin Squares
  44. Venkatesh Ramamoorthy, Marius Silaghi, Toshihiro Matsui, Katsutoshi Hirayama and Makoto Yokoo. The Design of Cryptographic Substitution Boxes Using CSPs
  45. Matti Järvisalo. On the Relative Efficiency of DPLL and OBDDs with Axiom and Join
  46. David Cohen, Martin Cooper, Martin Green and Daniel Marx. On guaranteeing polynomially-bounded search tree size
  47. Jessica Davies and Fahiem Bacchus. Solving MAXSAT by Solving a Sequence of Simpler SAT Instances
  48. Michel Lefebvre, Jean-François Puget and Petr Vilim. Route Finder : Efficiently Finding K Shortest PathsUsing Constraint Programming
  49. Gianluigi Greco and Francesco Scarcello. Structural Tractability of Constraint Optimization
  50. Emma Rollon and Javier Larrosa. Mini-Buckets with Dynamic Variable Elimination Ordering
  51. Oswaldo Olivo and Allen Emerson. A More Efficient BDD-Based QBF Solver
  52. Karen Petrie and Christopher Jefferson. Automatic Generation of Constraints for Partial Symmetry Breaking
  53. Samir A. Mohamed Elsayed and Laurent Michel. Synthesis of Search Algorithms from High-level CP Models
  54. Ronan Le Bras, Theodoros Damoulas, Ashish Sabharwal and Carla Gomes. Constraint Reasoning and Kernel Clustering for Pattern Decomposition With Scaling
  55. Mikolas Janota and Joao Marques-Silva. On Deciding MUS Membership with QBF
  56. Andrea Bartolini, Michele Lombardi, Michela Milano and Luca Benini. Neuron Constraints to Model Complex Real World Problem
  57. Martin Stølevik, Tomas Eric Nordlander, Atle Riise and Helle Frøyseth. A hybrid approach for solving real-world nurse rostering problems
  58. Barnaby Martin and Daniel Paulusma. The Computational Complexity of Disconnected Cut and 2K2-Partition