Lecture Notes in Computer Science 6308 - Springer Link

Lecture Notes in Computer Science Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen

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

6308

David Cohen (Ed.)

Principles and Practice of Constraint Programming – CP 2010 16th International Conference, CP 2010 St. Andrews, Scotland, September 6-10, 2010 Proceedings

13

Volume Editor David Cohen Department of Computer Science Royal Holloway, University of London Egham, Surrey, TW20 0EX United Kingdom E-mail: [email protected]

Library of Congress Control Number: 2010933521 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 ISSN ISBN-10 ISBN-13

0302-9743 3-642-15395-X Springer Berlin Heidelberg New York 978-3-642-15395-2 Springer Berlin Heidelberg New York

This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable to prosecution under the German Copyright Law. springer.com © Springer-Verlag Berlin Heidelberg 2010 Printed in Germany Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India Printed on acid-free paper 06/3180

Preface

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, models and 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 Committee 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 were solicited either 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 distinction 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. There were 101 (23 short) research track submissions of which 36 (8 short) were accepted, which is a 36% (35% of short) acceptance rate. Applications track submissions received special consideration and the acceptance rate was significantly higher than for the research track. There were 21 (2 short) applications track submissions of which 11 (1 short) were accepted for a 52% (50% of short) acceptance rate. There were three invited talks from distinguished scientists: Robert Nieuwenhuis, Edward Tsang and Moshe Vardi. These proceedings include abstracts of each of their presentations. Details of the wide variety of workshops and the four tutorials that took place as part of the conference are also included. I would like to thank the Association for Constraint Programming (ACP) for inviting me to be Program Chair. It has been a rewarding experience, not only because of the high quality of the papers submitted, but also for the help so readily given to me by friends and colleagues around the world. I want to thank all of the authors for submitting such interesting papers. It is their hard work that makes the conference so interesting, but the high quality of the submissions also makes the decision process challenging. I would also like to thank the members of the Program Committee for agreeing to help in the

VI

Preface

first place, and for the excellent standard of reviewing. My particular thanks go to those people who provided fourth reviews when decisions were most difficult. Several people deserve special mention. Karen Petrie, who, as Conference Chair, saved my life on many occasions. Ian Gent, who, as the Program Chair for CP 2009, was a source of invaluable information, warnings and good advice. Barry O’Sullivan for his speedy replies to questions, and general support. Peter Stuckey, who was the Applications Track Chair, Pedro Meseguer for the workshop organization, Thomas Schiex for managing the tutorials and Peter Nightingale and Standa Zivny for running the doctoral program. The local Organizing Committee always put in a great deal of work, often unthanked, to make a conference like this successful. Andrea Rendl as Publicity Chair and Neil Moore who ran the website helped me a lot during the build up to CP 2010. September 2010

David Cohen

Distinguished Papers

The Program Committee chose one paper from the Research Track, one paper from the Applications Track and one Student Paper to be recognized as achieving the highest standard submitted in their category.

Best Research Paper Testing Expressibility Is Hard, by Ross Willard.

Best Applications Paper Applying Constraint Programming to Identification and Assignment of Service Professionals, by Sigal Asaf, Haggai Eran, Yossi Richter, Daniel P. Connors, Donna L. Gresh, Julio Ortega and Michael J. Mcinnis.

Best Student Paper Computing the Density of States of Boolean Formulas, by Stefano Ermon, Carla Gomes and Bart Selman.

Workshops and Tutorials

Workshops As part of CP 2010 a number of workshops took place the day before the main conference, on September 6, 2010. – 9th Workshop on Constraint Modelling and Reformulation (ModRef 2010) – 10th Workshop on Symmetry in Constraint Satisfaction Problems (SymCon 2010) – 7th Workshop on Local Search Techniques in Constraint Satisfaction (LSCS 2010) – Third Workshop on Quantification in Constraint Programming (QiCP 2010) – 10th Workshop on Preferences and Soft Constraints (SofT 2010) – Third Workshop on Techniques for Implementing Constraint Programming Systems (TRICS 2010) – First Workshop on Constraint Reasoning and Graphical Structures – Third Workshop on Constraint Reasoning and Optimization for Computational Sustainability (CROCS at CP-10)

Tutorials Four tutorial presentations were given during the main program of the conference. – Distributed CSP, by Amnon Meisels. – SAT with Many Cores, by Youssef Hamadi. – The Valued CSP (VCSP), by Martin Cooper, Peter Jeavons and Simon de Givry. – Backdoors in CSPs, by Barry O’SUllivan.

Organization

Executive Committee Conference Chair Karen Petrie (University of Dundee, UK) Program Chair David Cohen, (Royal Holloway, University of London, UK) Applications Chair Peter Stuckey (University of Melbourne, Australia) Workshop Chair Pedro Meseguer (IIIA-CSIC, Spain) Tutorial Chair Thomas Schiex (INRA Toulouse, France) Doctoral Program Peter Nightingale (University of St. Andrews, UK) ˇ y (University of Oxford, UK) Chairs Standa Zivn´ Sponsorship Chair Ian Miguel (St. Andrews, UK) Publicity Chair Andrea Rendl (St. Andrews, UK)

Sponsors 4C - Cork Constraint Computational Centre ACP, Association for Constraint Programming Google, EMEA University Programs IBM Research Institute for Computational Sustainability, Cornell University, USA NICTA, National Information and Communications Technology, Australia Optimisation for Sustainable Development, Ecole Polytechnique, France SICS - Swedish Institute of Computer Science

Program Committee Roman Bartak Peter van Beek Hubie Chen Andy Chun David Cohen Martin Cooper Victor Dalmau Rina Dechter Alan Frisch Ian Gent Carla Gomes Emmanuel Hebrard Brahim Hnich Peter Jeavons George Katsirelos Zeynep Kiziltan

Charles University, Czech Republic University of Waterloo, Canada Universitat Pompeu Fabra, Spain City University of Hong Kong, Hong Kong Royal Holloway, University of London, UK IRIT-UPS, Toulouse, France Universitat Pompeu Fabra, Spain University of California, Irvine, USA University of York, UK University of St. Andrews, UK Cornell University, USA Cork Constraint Computation Centre, Ireland Izmir University of Economics, Turkey University of Oxford, UK CRIL, CNRS, France University of Bologna, Italy

XII

Organization

Jimmy Lee Pedro Meseguer Laurent Michel Peter Nightingale Barry O’Sullivan Justin Pearson Karen Petrie Claude-Guy Quimper Emma Rollon Francesca Rossi Thomas Schiex Christian Schulte Meinolf Sellmann Helmut Simonis Kostas Stergiou Peter Stuckey Mark Wallace Toby Walsh Roland Yap ˇ y Standa Zivn´

The Chinese University of Hong Kong, Hong Kong IIIA-CSIC, Spain University of Connecticut, USA University of St. Andrews, UK Cork Constraint Computation Centre, Ireland Uppsala University, Sweden University of Dundee, University of Dundee, UK Universit´e Laval, France Technical University of Catalonia, Spain University of Padova, Italy INRA Toulouse, France KTH - Royal Institute of Technology, Sweden Brown University, USA Cork Constraint Computation Centre, Ireland University of the Aegean, Greece University of Melbourne, Australia Monash University, Australia NICTA, Australia National University of Singapore, Singapore University of Oxford, UK

Organizing Committee David Cohen Maria Fox Alan Frisch Ian Gent Youssef Hamadi Peter Jeavons Chris Jefferson Tom Kelsey Andrei Krokhin Steve Linton Derek Long Ian Miguel Karen Petrie Patrick Prosser Barbara Smith Edward Tsang

Royal Holloway, University of London University of Strathclyde University of York University of St. Andrews Microsoft Research, Cambridge University of Oxford University of St. Andrews University of St. Andrews University of Durham University of St. Andrews University of Strathclyde University of St. Andrews University of Dundee University of Glasgow University of Leeds University of Essex

Organization

Additional Reviewers Kiyan Ahmadizadeh Ozgur Akgun Alexandre Albore Carlos Ans´etegui Magnus ˚ Agren Thanasis Balafoutis Mauro Bampo Ralph Becket Christian Bessiere Manuel Bodirsky Andrej Bogdanov Simone Bova Martin Brain Sebastian Brand Ken Brown Andrei Bulatov Hadrien Cambazard Catarina Carvalho Kenil Cheng Geoffrey Chu P´ aid´ı Creed James Cussens Jessica Davies Simon de Givry Thibaut Feydy Pierre Flener Yong Gao Marco Gavanelli Vibhav Gogate Laurent Granvilliers Magnus gren Tarik Hadzic Daniel Harabor Martin Henz Tim Januschowski Christopher Jefferson Serdar Kadioglu Kalev Kask Richard Kelly Lars Kotthoff Lukas Kroc Andrei Krokhin Daniel Kudenko Mikael Zayenz Lagerkvist

Arnaud Lallouet Javier Larrosa Yat Chiu Law Ronan LeBras Chavalit Likitvivatanavong Michele Lombardi Derek Long Ines Lynce Michael Lyu Yuri Malitsky Toni Mancini Radu Marinescu Joao Marques-Silva Robert Mateescu Jacopo Mauro Chris Mears Deepak Mehta Ian Miguel Michela Milano Neil Moore Nina Narodytska Gustav Nordh Olga Ohrimenko Albert Oliveras Lars Otten Justyna Petke Maria Silvia Pini C´edric Pralet Steve Prestwich Steven Prestwich Luis Quesada Miguel Ram´ırez Andrea Rendl Enric Rodr´ıguez-Carbonell Roberto Rossi Michel Rueher Tyrel Russell Ashish Sabharwal Domenico Salvagnin Horst Samulowitz Andrew Santosa Tom Schrijvers Brand Sebastian Charles F.K. Siu

XIII

XIV

Organization

David Stynes Pramudi Suraweera Guido Tack Michael Thomas Evgenij Thorstensen Marc Thurley Gilles Trombettoni Jeremie Vautard

G´erard Verfaillie Magnus Wahlstr¨ om Richard Wallace May H.C. Woo Michal Wrona Yuanlin Zhang Roie Zivan

Association for Constraint Programming

The Association for Constraint Programming (ACP) aims at promoting constraint programming in every aspect of the scientific world, by encouraging its theoretical and practical developments, its teaching in academic institutions, its adoption in the industrial world, and its use in applications. The ACP is a non-profit association, which uses the profit of the organized events to support future events or activities. At any given time members of the ACP are all attendees CP conferences of the past five years, and all members of the Program Committee of the current CP conference. The ACP is led by an Executive Committee (EC), which takes all the decisions necessary to achieve the goals of the association. In particular, the ACP EC organizes an annual international conference on constraint programming: selecting the venue and choosing the Program and Conference Chairs. This annual conference includes a doctoral program, which is intended to encourage doctoral students to work on CP and to participate in the CP conference. The ACP EC maintains a website (http://www.4c.ucc.ie/a4cp/) about all aspects of CP, and publishes a quarterly newsletter about CP events.

ACP Executive Committee President: Barry O’Sullivan Secretary: Jimmy H.M. Lee Treasurer: Thomas Schiex Conference Coordinator: Pedro Meseguer Others: – – – –

John Hooker Karen Petrie Peter Stuckey Roland Yap

Table of Contents

Invited Talks SAT Modulo Theories: Getting the Best of SAT and Global Constraint Filtering . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Robert Nieuwenhuis

1

Constraint-Directed Search in Computational Finance and Economics . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Edward Tsang

3

Constraints, Graphs, Algebra, Logic, and Complexity . . . . . . . . . . . . . . . . . Moshe Y. Vardi

8

Distinguished Papers Testing Expressibility Is Hard . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Ross Willard Applying Constraint Programming to Identification and Assignment of Service Professionals . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Sigal Asaf, Haggai Eran, Yossi Richter, Daniel P. Connors, Donna L. Gresh, Julio Ortega, and Michael J. Mcinnis Computing the Density of States of Boolean Formulas . . . . . . . . . . . . . . . . Stefano Ermon, Carla P. Gomes, and Bart Selman

9

24

38

Research Track Towards Parallel Non Serial Dynamic Programming for Solving Hard Weighted CSP . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . David Allouche, Simon de Givry, and Thomas Schiex

53

Making Adaptive an Interval Constraint Propagation Algorithm Exploiting Monotonicity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Ignacio Araya, Gilles Trombettoni, and Bertrand Neveu

61

Improving the Performance of maxRPC . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Thanasis Balafoutis, Anastasia Paparrizou, Kostas Stergiou, and Toby Walsh

69

Checking-Up on Branch-and-Check . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . J. Christopher Beck

84

XVIII

Table of Contents

Spatial, Temporal, and Hybrid Decompositions for Large-Scale Vehicle Routing with Time Windows . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Russell Bent and Pascal Van Hentenryck

99

Decomposition of the NValue Constraint . . . . . . . . . . . . . . . . . . . . . . . . . . . Christian Bessiere, George Katsirelos, Nina Narodytska, Claude-Guy Quimper, and Toby Walsh

114

Propagating the Bin Packing Constraint Using Linear Programming . . . . Hadrien Cambazard and Barry O’Sullivan

129

Sweeping with Continuous Domains . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Gilles Chabert and Nicolas Beldiceanu

137

A New Hybrid Tractable Class of Soft Constraint Problems . . . . . . . . . . . ˇ y Martin C. Cooper and Stanislav Zivn´

152

A Propagator for Maximum Weight String Alignment with Arbitrary Pairwise Dependencies . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Alessandro Dal Pal` u, Mathias M¨ ohl, and Sebastian Will

167

Using Learnt Clauses in maxsat . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Jessica Davies, Jeremy Cho, and Fahiem Bacchus

176

Domain Consistency with Forbidden Values . . . . . . . . . . . . . . . . . . . . . . . . . Yves Deville and Pascal Van Hentenryck

191

Generating Special-Purpose Stateless Propagators for Arbitrary Constraints . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Ian P. Gent, Chris Jefferson, Ian Miguel, and Peter Nightingale Including Ordinary Differential Equations Based Constraints in the Standard CP Framework . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Alexandre Goldsztejn, Olivier Mullier, Damien Eveillard, and Hiroshi Hosobe

206

221

Structural Tractability of Enumerating CSP Solutions . . . . . . . . . . . . . . . . Gianluigi Greco and Francesco Scarcello

236

Diversification and Intensification in Parallel SAT Solving . . . . . . . . . . . . . Long Guo, Youssef Hamadi, Said Jabbour, and Lakhdar Sais

252

A Systematic Approach to MDD-Based Constraint Programming . . . . . . Samid Hoda, Willem-Jan van Hoeve, and J.N. Hooker

266

A Complete Multi-valued SAT Solver . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Siddhartha Jain, Eoin O’Mahony, and Meinolf Sellmann

281

Exact Cover via Satisfiability: An Empirical Study . . . . . . . . . . . . . . . . . . . Tommi Junttila and Petteri Kaski

297

Table of Contents

On the Complexity and Completeness of Static Constraints for Breaking Row and Column Symmetry . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . George Katsirelos, Nina Narodytska, and Toby Walsh

XIX

305

Ensemble Classification for Constraint Solver Configuration . . . . . . . . . . . Lars Kotthoff, Ian Miguel, and Peter Nightingale

321

On Testing Constraint Programs . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Nadjib Lazaar, Arnaud Gotlieb, and Yahia Lebbah

330

On the Containment of Forbidden Patterns Problems . . . . . . . . . . . . . . . . . Florent Madelaine

345

Improving the Floating Point Addition and Subtraction Constraints . . . . Bruno Marre and Claude Michel

360

The Lattice Structure of Sets of Surjective Hyper-Operations . . . . . . . . . . Barnaby Martin

368

Constraint Based Scheduling to Deal with Uncertain Durations and Self-Timed Execution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Michele Lombardi and Michela Milano

383

Local Consistency and SAT-Solvers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Justyna Petke and Peter Jeavons

398

Heuristics for Planning with SAT . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Jussi Rintanen

414

Value-Ordering Heuristics: Search Performance vs. Solution Diversity . . . Yevgeny Schreiber

429

A New O(n2 log n) Not-First/Not-Last Pruning Algorithm for Cumulative Resource Constraints . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Andreas Schutt and Armin Wolf

445

A Generic Visualization Platform for CP . . . . . . . . . . . . . . . . . . . . . . . . . . . . Helmut Simonis, Paul Davern, Jacob Feldman, Deepak Mehta, Luis Quesada, and Mats Carlsson

460

Database Constraints and Homomorphism Dualities . . . . . . . . . . . . . . . . . . Balder ten Cate, Phokion G. Kolaitis, and Wang-Chiew Tan

475

A Box-Consistency Contractor Based on Extremal Functions . . . . . . . . . . Gilles Trombettoni, Yves Papegay, Gilles Chabert, and Odile Pourtallier

491

Exponential Propagation for Set Variables . . . . . . . . . . . . . . . . . . . . . . . . . . Justin Yip and Pascal Van Hentenryck

499

XX

Table of Contents

Applications Track An Empirical Study of Optimization for Maximizing Diffusion in Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Kiyan Ahmadizadeh, Bistra Dilkina, Carla P. Gomes, and Ashish Sabharwal An Integrated Modelling, Debugging, and Visualisation Environment for G12 . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Andreas Bauer, Viorica Botea, Mark Brown, Matt Gray, Daniel Harabor, and John Slaney

514

522

Global Constraints on Feature Models . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Ahmet Serkan Karata¸s, Halit O˘guzt¨ uz¨ un, and Ali Do˘gru

537

Constraint Programming for Mining n-ary Patterns . . . . . . . . . . . . . . . . . . Mehdi Khiari, Patrice Boizumault, and Bruno Cr´emilleux

552

An Integrated Business Rules and Constraints Approach to Data Centre Capacity Management . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Roman van der Krogt, Jacob Feldman, James Little, and David Stynes Context-Sensitive Call Control Using Constraints and Rules . . . . . . . . . . . David Lesaint, Deepak Mehta, Barry O’Sullivan, Luis Quesada, and Nic Wilson Load Balancing and Almost Symmetries for RAMBO Quorum Hosting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Laurent Michel, Alexander A. Shvartsman, Elaine Sonderegger, and Pascal Van Hentenryck Testing Continuous Double Auctions with a Constraint-Based Oracle . . . Roberto Casta˜ neda Lozano, Christian Schulte, and Lars Wahlberg A Safe and Flexible CP-Based Approach for Velocity Tuning Problems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . Micha¨el Soulignac, Michel Rueher, and Patrick Taillibert

568

583

598

613

628

Contingency Plans for Air Traffic Management . . . . . . . . . . . . . . . . . . . . . . Karl Sundequist Blomdahl, Pierre Flener, and Justin Pearson

643

Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .

659