Book Volume 8124 2013

Principles and Practice of Constraint Programming

19th International Conference, CP 2013, Uppsala, Sweden, September 16-20, 2013. Proceedings


ISBN: 978-3-642-40626-3 (Print) 978-3-642-40627-0 (Online)

Table of contents (64 chapters)

previous Page of 4
  1. Front Matter

    Pages -

  2. Invited Talks

    1. Chapter

      Pages 1-2

      Optimization for Policy Making: The Cornerstone for an Integrated Approach

    2. Chapter

      Pages 3-4

      Answer Set Programming: Boolean Constraint Solving for Knowledge Representation and Reasoning

    3. Chapter

      Pages 5-6

      Those Who Cannot Remember the Past Are Condemned to Repeat It

  3. Invited Public Lecture

    1. Chapter

      Pages 7-7

      Decide Different!

  4. Invited System Presentation

    1. Chapter

      Pages 8-29

      The Objective-CP Optimization System

  5. Best Technical Track Paper

    1. Chapter

      Pages 30-46

      Parallel Discrepancy-Based Search

  6. Best Application Track Paper

    1. Chapter

      Pages 47-62

      Bin Packing with Linear Usage Costs – An Application to Energy Management in Data Centres

  7. Best Student Paper

    1. Chapter

      Pages 63-79

      Filtering AtMostNValue with Difference Constraints: Application to the Shift Minimisation Personnel Task Scheduling Problem

  8. Technical Track Papers

    1. Chapter

      Pages 80-96

      A Parametric Approach for Smaller and Better Encodings of Cardinality Constraints

    2. Chapter

      Pages 97-106

      To Encode or to Propagate? The Best Choice for Each Constraint in SAT

    3. Chapter

      Pages 107-116

      Automated Symmetry Breaking and Model Selection in Conjure

    4. Chapter

      Pages 117-132

      Improving WPM2 for (Weighted) Partial MaxSAT

    5. Chapter

      Pages 133-142

      MinSAT versus MaxSAT for Optimization Problems

    6. Chapter

      Pages 143-158

      Adaptive Parameterized Consistency

    7. Chapter

      Pages 159-174

      Global Inverse Consistency for Interactive Constraint Satisfaction

    8. Chapter

      Pages 175-183

      Counting Spanning Trees to Guide Search in Constrained Spanning Tree Problems

    9. Chapter

      Pages 184-199

      On the Reduction of the CSP Dichotomy Conjecture to Digraphs

    10. Chapter

      Pages 200-216

      A Scalable Approximate Model Counter

    11. Chapter

      Pages 217-229

      Dominance Driven Search

    12. Chapter

      Pages 230-246

      Tractable Combinations of Global Constraints

previous Page of 4