Advertisement

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
    13. From High Girth Graphs to Hard Instances
      Carlos Ansótegui, Ramón Béjar, César Fernàndez, Carles Mateu
      Pages 298-312
    14. Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT
      Wanxia Wei, Chu Min Li, Harry Zhang
      Pages 313-326
    15. CPBPV: A Constraint-Programming Framework for Bounded Program Verification
      Hélène Collavizza, Michel Rueher, Pascal Van Hentenryck
      Pages 327-341
    16. Exploiting Common Subexpressions in Numerical CSPs
      Ignacio Araya, Bertrand Neveu, Gilles Trombettoni
      Pages 342-357
    17. A Soft Constraint of Equality: Complexity and Approximability
      Emmanuel Hebrard, Barry O’Sullivan, Igor Razgon
      Pages 358-371
    18. Structural Tractability of Propagated Constraints
      Martin J. Green, Christopher Jefferson
      Pages 372-386
    19. Connecting ABT with Arc Consistency
      Ismel Brito, Pedro Meseguer
      Pages 387-401
    20. Elicitation Strategies for Fuzzy Constraint Problems with Missing Preferences: Algorithms and Experimental Studies
      Mirco Gelain, Maria Silvia Pini, Francesca Rossi, K. Brent Venable, Toby Walsh
      Pages 402-417
    21. Reformulating Positive Table Constraints Using Functional Dependencies
      Hadrien Cambazard, Barry O’Sullivan
      Pages 418-432
    22. Relaxations for Compiled Over-Constrained Problems
      Alexandre Papadopoulos, Barry O’Sullivan
      Pages 433-447
    23. Approximate Compilation of Constraints into Multivalued Decision Diagrams
      Tarik Hadzic, John N. Hooker, Barry O’Sullivan, Peter Tiedemann
      Pages 448-462
    24. Quantified Constraint Optimization
      Marco Benedetti, Arnaud Lallouet, Jérémie Vautard
      Pages 463-477
    25. Exploiting Decomposition in Constraint Optimization Problems
      Matthew Kitching, Fahiem Bacchus
      Pages 478-492
    26. A Coinduction Rule for Entailment of Recursively Defined Properties
      Joxan Jaffar, Andrew E. Santosa, Răzvan Voicu
      Pages 493-508
    27. Maintaining Generalized Arc Consistency on Ad Hoc r-Ary Constraints
      Kenil C. K. Cheng, Roland H. C. Yap
      Pages 509-523

  5. Research Track Short Papers

    1. Perfect Constraints Are Tractable
      András Z. Salamon, Peter G. Jeavons
      Pages 524-528
    2. Efficiently Solving Problems Where the Solutions Form a Group
      Karen E. Petrie, Christopher Jefferson
      Pages 529-533
    3. Approximate Solution Sampling (and Counting) on AND/OR Spaces
      Vibhav Gogate, Rina Dechter
      Pages 534-538
    4. Model Restarts for Structural Symmetry Breaking
      Daniel Heller, Aurojit Panda, Meinolf Sellmann, Justin Yip
      Pages 539-544
    5. An Elimination Algorithm for Functional Constraints
      Yuanlin Zhang, Roland H. C. Yap, Chendong Li, Satyanarayana Marisetti
      Pages 545-549
    6. Crossword Puzzles as a Constraint Problem
      Anbulagan, Adi Botea
      Pages 550-554
    7. Recent Hybrid Techniques for the Multi-Knapsack Problem
      Carlos Diego Rodrigues, Philippe Michelon, Manoel B. Campêlo
      Pages 555-559
    8. Edge Matching Puzzles as Hard SAT/CSP Benchmarks
      Carlos Ansótegui, Ramón Béjar, César Fernàndez, Carles Mateu
      Pages 560-565
    9. Test Strategy Generation Using Quantified CSPs
      Martin Sachenbacher, Paul Maier
      Pages 566-570
    10. Perfect Derived Propagators
      Christian Schulte, Guido Tack
      Pages 571-575
    11. Refined Bounds for Instance-Based Search Complexity of Counting and Other #P Problems
      Lars Otten, Rina Dechter
      Pages 576-581
    12. Transforming Inconsistent Subformulas in MaxSAT Lower Bound Computation
      Chu Min Li, Felip Manyà, Nouredine Ould Mohamedou, Jordi Planes
      Pages 582-587
    13. Semi-automatic Generation of CHR Solvers for Global Constraints
      Frank Raiser
      Pages 588-592
    14. Stochastic Local Search for the Optimal Winner Determination Problem in Combinatorial Auctions
      Dalila Boughaci, Belaid Benhamou, Habiba Drias
      Pages 593-597
    15. Revisiting the Upper Bounding Process in a Safe Branch and Bound Algorithm
      Alexandre Goldsztejn, Yahia Lebbah, Claude Michel, Michel Rueher
      Pages 598-602

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
  • Buy this book on publisher's site