Recent Advances in Constraints

Joint ERCIM/CoLogNet International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2004, Lausanne, Switzerland, June 23-25, 2004, Revised Selected and Invited Papers

ISBN: 978-3-540-25176-7 (Print) 978-3-540-32252-8 (Online)

Table of contents (15 chapters)

  1. Front Matter

    Pages -

  2. Constraint Propagation

    1. No Access

      Book Chapter

      Pages 1-11

      GCC-Like Restrictions on the Same Constraint

    2. No Access

      Book Chapter

      Pages 12-25

      A Note on Bilattices and Open Constraint Programming

    3. No Access

      Book Chapter

      Pages 26-40

      Pruning by Equally Constrained Variables

  3. Search

    1. No Access

      Book Chapter

      Pages 41-55

      Trying Again to Fail-First

    2. No Access

      Book Chapter

      Pages 56-70

      Characterization of a New Restart Strategy for Randomized Backtrack Search

    3. No Access

      Book Chapter

      Pages 71-85

      Dynamic Distributed BackJumping

    4. No Access

      Book Chapter

      Pages 86-97

      A Value Ordering Heuristic for Local Search in Distributed Resource Allocation

    5. No Access

      Book Chapter

      Pages 98-112

      Automatically Exploiting Symmetries in Constraint Programming

    6. No Access

      Book Chapter

      Pages 113-127

      New Structural Decomposition Techniques for Constraint Satisfaction Problems

  4. Applications

    1. No Access

      Book Chapter

      Pages 128-141

      Algorithms for the Maximum Hamming Distance Problem

    2. No Access

      Book Chapter

      Pages 142-156

      A System Prototype for Solving Multi-granularity Temporal CSP

    3. No Access

      Book Chapter

      Pages 157-171

      Computing Equilibria Using Interval Constraints

    4. No Access

      Book Chapter

      Pages 172-186

      Constraint-Based Approaches to the Covering Test Problem

    5. No Access

      Book Chapter

      Pages 187-200

      Super Solutions for Combinatorial Auctions

    6. No Access

      Book Chapter

      Pages 201-215

      Better Propagation for Non-preemptive Single-Resource Constraint Problems

  5. Back Matter

    Pages -