CP 2009                                The 15th International Conference on Principles and Practice of Constraint Programming                 Lisbon, Portugal

Home Program Events Organisation Papers Submission Registration & Accommodation Local & Travel Information

Program CP 2009 includes a technical programme, where presentations of research and application papers and invited talks will describe the best results and techniques in the state-of-the-art of constraint programming. One day of Workshops precedes the conference. Tutorials and the Doctoral Programme will form part of the main programme. See the list of Accepted Papers ... and the Prize Winning ones! (Check also Events)   Program Overview (pdf)   Detailed Program Sunday,  Monday,  Tuesday,  Wednesday,  Thursday   Sunday, 20 September Workshops + Doctoral Programme Presentations 9:15 - 12:15   Morning or Full day workshops:  IntCP, LSCS, ModRef, SymCon, WCB 12:15   Lunch 13:45 - 16:45   Afternoon or Full day workshops:  BPPC, LSCS, ModRef, SymCon, CROCS 17:00 - 18:00    Doctoral Programme presentations   Monday, 21 September 09:00 Invited Talk Carla Gomes 10:00 Best Research Track Paper Petr Vilím 10:25 Coffee Break 10:55     Research Track Research Track (4 papers) (4 papers)     12:35 Lunch Break 14:00 Tutorial Application Track B.O'Sullivan & I. Razgon (3 papers)     15:15 Coffee Break 15:45 Research Track Research Track (2 papers) (2 papers) 16:35 Break 16:45 Doctoral P. Tutorial   Barry O'Sullivan Research Track 17:35 Results from (3 papers) CS Competition   18:00 Day Close 19:00 Reception at Town Hall 21:00 Doctoral Program Dinner   Details: 9:00   (Session Chair: Pedro Barahona)           Invited Talk:  Carla Gomes.           Challenges for Constraint Reasoning and Optimization in Computational Sustainability 10:00   Prize Paper: Best Research Track Paper               Petr Vilím.   Edge Finding Filtering Algorithm for Discrete Cumulative Resources in O(kn log n) 10.25  Coffee 10:55   Parallel Session: Track A.  Research Track  (session chair: Mats Carlsson) Christian Schulte and Guido Tack.   Weakly Monotonic Propagators Justin Yip and Pascal Van Hentenryck.   Evaluation of Length-Lex Set Variables Mikael Lagerkvist and Christian Schulte.   Propagator Groups Raphael M. Reischuk, Christian Schulte, Peter J. Stuckey and Guido Tack.   Maintaining State in Propagation Solvers Track B.  Research Track  (session chair: Meinolf Sellmann) Andrew Grayland, Ian Miguel and Colva Roney-Dougal.   Snake Lex: an Alternative to Double Lex Naoki Ohta, Vincent Conitzer, Ryo Ichimura, Yuko Sakurai, Atsushi Iwasaki and Makoto Yokoo.   Coalition Structure Generation Utilizing Compact Characteristic  Function Representations Vianney le Clément, Yves Deville and Christine Solnon.   Constraint-Based Graph Matching Alex Fukunaga.   Search Spaces for Min-Perturbation Repair 12:35   Lunch 14:00   Parallel Session Track A.   Tutorial  (session chair: Joao Marques-Silva) Exploiting Fixed-Parameter Tractability in Satisfiability and Constraint Satisfaction, by Barry O'Sullivan and Igor Razgon Track B.   Application Track  (session chair: Ian Gent) Laurent Michel, Alexander Shvartsman, Pascal Van Hentenryck, Elaine Sonderegger and Martijn Moraal.   Online Selection of Quorum Systems for RAMBO Reconfiguration Alberto Delgado, Rune Jensen and Christian Schulte.   Generating Optimal Stowage Plans for Container Vessel Bays Sophie Huczynska, Paul McKay, Ian Miguel and Peter Nightingale.   Modelling Equidistant Frequency Permutation Arrays: An Application of Constraints to Mathematics 15:15   Coffee 15:45   Parallel Session: Track A: Research Track  (session chair: Ken Brown) Geoffrey Chu, Christian Schulte and Peter Stuckey.   Confidence-based Work Stealing in Parallel Constraint Programming Redouane Ezzahir, Christian Bessiere, Mohamed Wahbi, Imade Benelallam and El Houssine Bouyakhf.   Asynchronous Inter-Level Forward-Checking for DisCSPs Track B: Research Track  (session chair: Ian Miguel) Emmanuel Hebrard, Daniel Marx, Barry O'Sullivan and Igor Razgon.   Constraints of Difference and Equality: A Complete Taxonomic Characterisation Michael Maher.   SOGgy Constraints: Soft Open Global Constraints 16:35   10 minute break (no refreshments) 16:45   Parallel Session: Track A  (session chair: Karen Petrie): Doctoral Program Tutorial :  Barry O'Sullivan (17:35)Results of Constraint Solver Competition 2009:   Marc van Dongen, Christophe Lecoutre, Olivier Roussel Track B  (session chair: Ines Lynce): Geoffrey Chu, Peter Stuckey and Maria Garcia de la Banda.   Using relaxations in Maximum Density Still Life Carlos Ansotegui, Maria Luisa Bonet and Jordi Levy.   On the Structure of Industrial SAT Instances Arthur Choi, Trevor Standley and Adnan Darwiche.   Approximating Weighted Max-SAT Problems by Compensating for Relaxations 18:00   Close 19:30   Reception at Town Hall (buses leave at 19:00) 21:00   Doctoral Program Dinner at ORANGE ßa       Tuesday, 22 September 09:00 Invited Talk Philippe Baptiste 10:00 Best Application Track Paper Helmut Simonis 10:25 Coffee Break 10:55     Research Track Research Track (4 papers) (4 papers)     12:35 Lunch Break 14:00 Tutorial Research Track Willem-Jan van Hoeve (3 papers)     15:15 Coffee Break 15:45 Poster Session (Doctoral Programme) 16:45 Doctoral P. Tutorial Research Track Karen Petrie (2 papers) 17:35 Break 17:45 ACP General Meeting 19:00 Day Close 20:30 Program Committee Dinner   Details: 9:00   (Session Chair: Mark Wallace)            Invited Talk:  Philippe Baptiste            Constraint-based Schedulers, do they really work? 10:00   Prize Paper: Best Application Track Paper Helmut Simonis.   A Hybrid Constraint Model for the Routing and Wavelength Assignment Problem 10:25   Coffee 10:55   Parallel Session: Track A.  Research Track  (session chair: Christian Bessiere) Alan Frisch and Peter Stuckey.   The Proper Treatment of Undefinedness in Constraint Languages Stanislav Zivny and Peter G. Jeavons.   The complexity of valued constraint models Christopher Jefferson, Serdar Kadioglu, Karen Petrie, Meinolf Sellmann and Stanislav Zivny.   Same-Relation Constraints David Cohen, Martin Green and Chris Houghton.   Constraint Representations and Structural Tractability Track B.  Research Track  (session chair: Ashish Sabharwal) Ignacio Araya, Gilles Trombettoni and Bertrand Neveu.   Filtering Numerical CSPs Using Well-Constrained Subsystems George Katsirelos, Sebastian Maneth, Nina Narodytska and Toby Walsh.   Restricted Global Grammar Constraints Gilles Chabert, Luc Jaulin and Xavier Lorca.   A Constraint on the Number of Distinct Vectors with Application to Localization Ronan Le Bras, Alessandro Zanarini and Gilles Pesant.   Efficient Generic Search Heuristics within the EMBP framework 12:35   Lunch 14:00   Parallel Session: Track A.   Tutorial  (session chair: Francesca Rossi) Soft Global Constraints, by Willem-Jan van Hoeve Track B.   Research Track  (session chair: Chris Jefferson) Meinolf Sellmann.   On Decomposing Knapsack Constraints for Length-Lex Bounds Consistency Gilles Chabert and Luc Jaulin.   Hull Consistency Under Monotonicity Christophe Lecoutre and Olivier Roussel.   Failed Value Consistencies for Constraint Satisfaction 15:15  Coffee + Poster Session (Doctoral Programme) 15:45  Poster Session (Doctoral Programme) 16:45   Parallel Session: Track A  (session chair: Olivia Smith): Doctoral Program Tutorial:   Karen Petrie Track B  (session chair: Roland Yap): Alexandre Papadopoulos and Barry O'Sullivan.   Compiling all Possible Conflicts of a CSP Yevgeny Schreiber.   Cost-Driven Interactive CSP with Constraint Relaxation 17:35   End of Session 17:45   Association for Constraint Programming, General Meeting 19:00   Close 20:30   Program Committee Dinner       Wednesday, 23 September 09:00 ACP Research Excellence Award to Alan Mackworth 10:00 ACP Doctoral Award Chris Jefferson 10:25 Coffee Break 10:55     Research Track Research Track (4 papers) (4 papers)     12:35 Lunch Break 14:00 Tutorial Research Track C.Jefferson & M.Sellmann (3 papers)     15:15 Coffee Break 15:45 Panel Discussion:  Standardisation in Constraint Programming 17:00 Day Close  18:00 Social Programme   Details: 9:00  (Session Chair: Barry O'Sullivan)             ACP Research Excellence Award to Alan Mackworth.            Thriving with Constraints 10:00   ACP Doctoral Award to Chris Jefferson.              Representations in Constraint Programming 10:25   Coffee 10:55   Parallel Session: Track A  (session chair: Gerard Verfaillie): Serdar Kadioglu and Meinolf Sellmann.   Dialectic Search Carlos Ansotegui Gil, Meinolf Sellmann and Kevin Tierney.   A Gender-Based Genetic Algorithm for the Automatic Configuration of Solvers Pascal Van Hentenryck, Carleton Coffrin and Boris Gutkovich.   Constraint-Based Local Search for the Automatic Generation of Architectural Tests Magnus Ågren.   Memoisation for constraint-based local search Track B  (session chair: Pedro Barahona): Thibaut Feydy and Peter Stuckey.   Lazy Clause Generation Reengineered Deepak Mehta, Barry O'Sullivan, Luis Quesada and Nic Wilson.   Search Space Extraction Joxan Jaffar, Andrew Edward Santosa and Razvan Voicu.   An Interpolation Method for CLP Traversal Anika Schumann, Martin Sachenbacher and Jinbo Huang.   Constraint-based Optimal Testing Using DNNF Graphs 12:35   Lunch 14:00   Parallel Session: Track A.   Tutorial  (session chair: Youssef Hamadi) Amortized and Expected Case Analysis of Constraint Propagation Algorithms, by Chris Jefferson, Meinolf Sellmann Track B.   Research Track  (session chair: Felip Manya): Konstantin Korovin, Nestan Tsiskaridze and Andrei Voronkov.   Conflict Resolution Cédric Pralet and Gérard Verfaillie.   Slice Encoding for Constraint-based Planning Mohammad Fazel-Zarandi and Chris Beck.   Solving a Location-Allocation Problem with Logic-Based Benders'  Decomposition 15:15   Coffee 15:45   Panel Discussion:  Standardisation in Constraint Programming Chair: Ian Gent (St. Andrews) Panellists: Jacob Feldman, Cork, Ireland (ACP Standards) Narendra Jussien, EMN Nantes, France (ACP Standards/Choco) Peter Stuckey, Melbourne, Australia (G12) Petr Vilim, IBM, Czech Republic (ILOG CP Optimizer) Christian Schulte, KTH, Sweden (Gecode) 17:00   Close 18:00   Social Programme, Starting at National Museum of Ancient Art (buses leave at 17:30)       Thursday, 24 September 09:00 Invited Talk Barbara Smith 10:00 Best Student Paper Knot Pipatsrisawat & Adnan Darwiche 10:25 Coffee Break 10:55     Application Track Research Track (4 papers) (4 papers)     12:35 Lunch Break 14:00     Research Track Research Track (4 papers) (4 papers)     15:40 Coffe & Conference Close   Details: 9:00  (Session Chair: Ian Gent)            Invited Talk:  Barbara Smith            Observations on Symmetry Breaking 10:00   Prize Paper: Best Student Paper Knot Pipatsrisawat and Adnan Darwiche.   On the Power of Clause-Learning SAT Solvers with Restarts 10:25   Coffee 10:55   Parallel Session: Track A.  Applications Track  (session chair: Simon de Givry) Ivan Dotu, Pascal Van Hentenryck, Miguel Patricio, A Berlanga, Jose Garcia and Jose Molina.   Real-Time Tabu Search for Video Tracking Haggai Eran, Bella Dubrov, Ari Freund, Edward F. Mark, Shyam Ramji and Timothy A. Schell.   Pin Assignment using Stochastic Local Search Constraint Programming Jean-Philippe Métivier, Patrice Boizumault and Samir Loudni.   Solving Nurse Rostering Problems Using Soft Global Constraints Andrew Loewenstern.   Scheduling the CB1000 Nanoproteomic Analysis System with Python, Tailor, and Minion Track B.  Research Track  (session chair: Toby Walsh) Andreas Schutt, Thibaut Feydy, Peter Stuckey and Mark Wallace.   Why cumulative decomposition is not as bad as it sounds Geoffrey Chu and Peter Stuckey.   Minimizing the maximum number of open stacks by customer search Michele Lombardi and Michela Milano.   A Precedence Constraint Posting Approach for the RCPSP with Time Lags and Variable Durations Diarmuid Grimes, Emmanuel Hebrard and Arnaud Malapert.   Closing the Open Shop: Contradicting Conventional Wisdom 12:35   Lunch 14:00   Parallel Session: Track A: Research Track  (session chair: Pedro Meseguer) Radu Marinescu.   Exploiting Problem Decomposition in Multi-objective Constraint Optimization Tarik Hadzic, Alan Holland and Barry O'Sullivan.   Reasoning about Optimal Collections of Solutions Aurélie Favier, Simon de Givry and Philippe Jégou.   Exploiting Problem Structure for Solution Counting Christian Bessiere, Emmanuel Hebrard and Barry O'Sullivan.   Minimising Decision Tree Size as Combinatorial Optimisation Track B: Research Track  (session chair: Ian Gent) François Fages and Aurélien Rizk.   From Model-Checking to Temporal Logic Constraint Solving Brahim Hnich, Roberto Rossi, S. Armagan Tarim and Steven Prestwich.   Synthesizing Filtering Algorithms for Global Chance-Constraints Steve Prestwich, Armagan Tarim, Roberto Rossi and Brahim Hnich.   Evolving Parameterised Policies for Stochastic Constraint Programming David Stynes and Kenneth N. Brown.   Realtime Online Solving of Quantifed CSPs 15:40   Coffee Close Header picture (© Osvaldo Gago): Rua Augusta's Triumphal Arch