Principles and Practice of Constraint Programming

14th International Conference, CP 2008, Sydney, Australia, September 14-18, 2008. Proceedings

  • Editors
  • Peter J. Stuckey
Conference proceedings CP 2008

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

Table of contents

  1. Front Matter
    PDF

  2. Invited Lecture

    1. Back to the Complexity of Universal Programs
      Alain Colmerauer
      Pages 1-20

  3. Applications Track Long Papers

    1. A Constraint Programming Approach for Allocation and Scheduling on the CELL Broadband Engine
      Luca Benini, Michele Lombardi, Michela Milano, Martino Ruggiero
      Pages 21-35
    2. Planning and Scheduling the Operation of a Very Large Oil Pipeline Network
      Arnaldo V. Moura, Cid C. de Souza, Andre A. Cire, Tony M. T. Lopes
      Pages 36-51
    3. Search Strategies for Rectangle Packing
      Helmut Simonis, Barry O’Sullivan
      Pages 52-66
    4. Solving a Telecommunications Feature Subscription Configuration Problem
      David Lesaint, Deepak Mehta, Barry O’Sullivan, Luis Quesada, Nic Wilson
      Pages 67-81
    5. Protein Structure Prediction with Large Neighborhood Constraint Programming Search
      Ivan Dotu, Manuel Cebrián, Pascal Van Hentenryck, Peter Clote
      Pages 82-96
    6. An Application of Constraint Programming to Superblock Instruction Scheduling
      Abid M. Malik, Michael Chase, Tyrel Russell, Peter van Beek
      Pages 97-111

  4. Research Track Long Papers

    1. Classes of Submodular Constraints Expressible by Graph Cuts
      Stanislav Živný, Peter G. Jeavons
      Pages 112-127
    2. Optimization of Simple Tabular Reduction for Table Constraints
      Christophe Lecoutre
      Pages 128-143
    3. Universal Booleanization of Constraint Models
      Jinbo Huang
      Pages 144-158
    4. Flow-Based Propagators for the SEQUENCE and Related Global Constraints
      Michael Maher, Nina Narodytska, Claude-Guy Quimper, Toby Walsh
      Pages 159-174
    5. Guiding Search in QCSP +  with Back-Propagation
      Guillaume Verger, Christian Bessiere
      Pages 175-189
    6. A New Framework for Sharp and Efficient Resolution of NCSP with Manifolds of Solutions
      Alexandre Goldsztejn, Laurent Granvilliers
      Pages 190-204
    7. A Branch and Bound Algorithm for Numerical MAX-CSP
      Jean-Marie Normand, Alexandre Goldsztejn, Marc Christie, Frédéric Benhamou
      Pages 205-219
    8. A Geometric Constraint over k-Dimensional Objects and Shapes Subject to Business Rules
      Mats Carlsson, Nicolas Beldiceanu, Julien Martin
      Pages 220-234
    9. Cost-Based Domain Filtering for Stochastic Constraint Programming
      Roberto Rossi, S. Armagan Tarim, Brahim Hnich, Steven Prestwich
      Pages 235-250
    10. Dichotomic Search Protocols for Constrained Optimization
      Meinolf Sellmann, Serdar Kadioglu
      Pages 251-265
    11. Length-Lex Bounds Consistency for Knapsack Constraints
      Yuri Malitsky, Meinolf Sellmann, Willem-Jan van Hoeve
      Pages 266-281
    12. A Framework for Hybrid Tractability Results in Boolean Weighted Constraint Satisfaction Problems
      T. K. Satish Kumar
      Pages 282-297

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 14th International Conference on Principles and Practice of Constraint Programming, CP 2008, Sydney, Australia, September, 2008.

The 27 revised full papers and 23 revised short papers presented together with 6 application papers and the abstracts of one invited lecture were carefully reviewed and selected from 120 submissions. All current issues of computing with constraints are addressed, ranging from methodological and foundational aspects - using algorithms, environments, languages, models and systems - to solving real-world problems in various application fields.

Keywords

CSP heuristics Constraint SAT solvers algorithms approximability complexity con constraint logic programming knapsack protein structure qcsp rectangle packing submodular constraints superblock instruction scheduling table constraints

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-540-85958-1
  • Copyright Information Springer-Verlag Berlin Heidelberg 2008
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-85957-4
  • Online ISBN 978-3-540-85958-1
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book