Principles and Practice of Constraint Programming - CP 2002

8th International Conference, CP 2002 Ithaca, NY, USA, September 9–13, 2002 Proceedings

  • Pascal Van Hentenryck
Conference proceedings CP 2002

DOI: 10.1007/3-540-46135-3

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

Table of contents (83 papers)

  1. Front Matter
    Pages I-XVI
  2. Technical Papers

    1. Reduced Cost-Based Ranking for Generating Promising Subproblems
      Michela Milano, Willem J. van Hoeve
      Pages 1-16
    2. Integrating Constraint and Integer Programming for the Orthogonal Latin Squares Problem
      Gautam Appa, Ioannis Mourtos, Dimitris Magos
      Pages 17-32
    3. On Optimal Correction of Inconsistent Linear Constraints
      Paula Amaral, Pedro Barahona
      Pages 33-46
    4. Temporal Planning through Mixed Integer Programming: A Preliminary Report
      Yannis Dimopoulos, Alfonso Gerevini
      Pages 47-62
    5. A New Multi-resource cumulatives Constraint with Negative Heights
      Nicolas Beldiceanu, Mats Carlsson
      Pages 63-79
    6. Global Constraints for Lexicographic Orderings
      Alan Frisch, Brahim Hnich, Zeynep Kiziltan, Ian Miguel, Toby Walsh
      Pages 93-108
    7. A Global Filtering Algorithm for Handling Systems of Quadratic Equations and Inequations
      Yahia Lebbah, Michel Rueher, Claude Michel
      Pages 109-123
    8. Amplification of Search Performance through Randomization of Heuristics
      Vincent A. Cicirello, Stephen F. Smith
      Pages 124-138
    9. Local Probing Applied to Scheduling
      Olli Kamarainen, Hani El Sakkout
      Pages 155-171
    10. A Hybrid Approach for SAT
      Djamal Habet, Chu Min Li, Laure Devendeville, Michel Vasquez
      Pages 172-184
    11. Recovering and Exploiting Structural Knowledge from CNF Formulas
      Richard Ostrowski, Éric Grégoire, Bertrand Mazure, Lakhdar Saïs
      Pages 185-199
    12. Accelerating Random Walks
      Wei Wei, Bart Selman
      Pages 216-232
    13. Scaling and Probabilistic Smoothing: Efficient Dynamic Local Search for SAT
      Frank Hutter, Dave A. D. Tompkins, Holger H. Hoos
      Pages 233-248
    14. Learning and Solving Soft Temporal Constraints: An Experimental Study
      Francesca Rossi, Alessandro Sperduti, Kristen B. Venable, Lina Khatib, Paul Morris, Robert Morris
      Pages 249-264
    15. Opportunistic Specialization in Russian Doll Search
      Pedro Mesegue, Martí Sánchez, Gérard Verfaillie
      Pages 264-279
    16. Range-Based Algorithm for Max-CSP
      Thierry Petit, Jean-Charles Régin, Christian Bessière
      Pages 280-294

About these proceedings

Introduction

This book constitutes the refereed proceedings of the 8th International Conference on Principles and Practice of Constraint Programming, CP 2002, held in Ithaca, NY, USA in September 2002.
The 38 revised full papers and 6 innovative application papers as well as the 14 short papers presented toghether with 25 abstracts from contributions to the doctoral program were carefully reviewed and selected from 146 submissions. All current issues in constraint processing are addressed, ranging from theoretical and foundational issues to application in various fields.

Keywords

Constraint Logic Programming Constraint Programming Constraint Propagation Constraint Satisfaction Decision Making Distributed Making Linear Constraints Search Algorithms Variable algorithm complexity heuristics optimization programming proving

Editors and affiliations

  • Pascal Van Hentenryck
    • 1
  1. 1.Brown UniversityProvidenceUSA

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2002
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-44120-5
  • Online ISBN 978-3-540-46135-7
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349