Principles and Practice of Constraint Programming – CP 2003

9th International Conference, CP 2003, Kinsale, Ireland, September 29 – October 3, 2003. Proceedings

  • Francesca Rossi
Conference proceedings CP 2003

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

Table of contents

  1. Front Matter
  2. Invited Papers

  3. Best Paper

    1. Pascal Van Hentenryck, Laurent Michel
      Pages 65-80
  4. Full Papers

    1. Carlos Ansótegui, Jose Larrubia, Felip Manyà
      Pages 96-107
    2. Olivier Bailleux, Yacine Boufkhad
      Pages 108-122
    3. Stefano Bistarelli, Philippe Codognet, Kin-Chuen Hui, Jimmy Ho Man Lee
      Pages 138-152
    4. Stéphane Bourdais, Philippe Galinier, Gilles Pesant
      Pages 153-167
    5. Craig Boutilier, Relu Patrascu, Pascal Poupart, Dale Schuurmans
      Pages 168-182
    6. Andrei A. Bulatov, Peter Jeavons
      Pages 183-198
    7. Chi Kan Cheng, Jimmy Ho Man Lee, Peter J. Stuckey
      Pages 214-228
    8. Chiu Wo Choi, Jimmy Ho Man Lee, Peter J. Stuckey
      Pages 229-243
    9. David A. Cohen, Martin Cooper, Peter Jeavons, Andrei Krokhin
      Pages 244-258
    10. Jorge Cruz, Pedro Barahona
      Pages 259-273

About these proceedings

Introduction

This volume contains the proceedings of the Ninth International Conference on Principles and Practice of Constraint Programming (CP 2003), held in Kinsale, Ireland, from September 29 to October 3, 2003. Detailed information about the CP 2003 conference can be found at the URL http://www.cs.ucc.ie/cp2003/ The CP conferences are held annually and provide an international forum for the latest results on all aspects of constraint programming. Previous CP conferences were held in Cassis (France) in 1995, in Cambridge (USA) in 1996, in Schloss Hagenberg (Austria) in 1997, in Pisa (Italy) in 1998, in Alexandria (USA) in 1999, in Singapore in 2000, in Paphos (Cyprus) in 2001, and in Ithaca (USA) in 2002. Like previous CP conferences, CP 2003 again showed the interdisciplinary nature of computing with constraints, and also its usefulness in many problem domains and applications. Constraint programming, with its solvers, languages, theoretical results, and applications, has become a widely recognized paradigm to model and solve successfully many real-life problems, and to reason about problems in many research areas.

Keywords

CSP heuristics case-based reasoning combinatorial optimization complexity constraint logic programming constraint programming constraint satisfaction constraint solving decision making distributed cons logic metaheuristic optimization real-time search strategy

Editors and affiliations

  • Francesca Rossi
    • 1
  1. 1.Dipartimento di Matematica Pura ed ApplicataUniversità di PadovaPadovaItaly

Bibliographic information

  • DOI https://doi.org/10.1007/b13743
  • Copyright Information Springer-Verlag Berlin Heidelberg 2003
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-20202-8
  • Online ISBN 978-3-540-45193-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book