Principles and Practice of Constraint Programing-CP 2013

1. Front Matter

   PDF

2. Invited Talks

   1. Optimization for Policy Making: The Cornerstone for an Integrated Approach

      • Michela Milano

      Pages 1-2

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

      • Torsten Schaub

      Pages 3-4

   3. Those Who Cannot Remember the Past Are Condemned to Repeat It

      • Peter J. Stuckey

      Pages 5-6

3. Invited Public Lecture

   1. Decide Different!

      • Pascal Van Hentenryck

      Pages 7-7

4. Invited System Presentation

   1. The Objective-CP Optimization System

      • Pascal Van Hentenryck, Laurent Michel

      Pages 8-29

5. Best Technical Track Paper

   1. Parallel Discrepancy-Based Search

      • Thierry Moisan, Jonathan Gaudreault, Claude-Guy Quimper

      Pages 30-46

6. Best Application Track Paper

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

      • Hadrien Cambazard, Deepak Mehta, Barry O’Sullivan, Helmut Simonis

      Pages 47-62

7. Best Student Paper

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

      • Jean-Guillaume Fages, Tanguy Lapègue

      Pages 63-79

8. Technical Track Papers

   1. A Parametric Approach for Smaller and Better Encodings of Cardinality Constraints

      • Ignasi Abío, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell

      Pages 80-96

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

      • Ignasi Abío, Robert Nieuwenhuis, Albert Oliveras, Enric Rodríguez-Carbonell, Peter J. Stuckey

      Pages 97-106

   3. Automated Symmetry Breaking and Model Selection in Conjure

      • Ozgur Akgun, Alan M. Frisch, Ian P. Gent, Bilal Syed Hussain, Christopher Jefferson, Lars Kotthoff et al.

      Pages 107-116

   4. Improving WPM2 for (Weighted) Partial MaxSAT

      • Carlos Ansótegui, Maria Luisa Bonet, Joel Gabàs, Jordi Levy

      Pages 117-132

   5. MinSAT versus MaxSAT for Optimization Problems

      • Josep Argelich, Chu-Min Li, Felip Manyà, Zhu Zhu

      Pages 133-142

   6. Adaptive Parameterized Consistency

      • Amine Balafrej, Christian Bessiere, Remi Coletta, El Houssine Bouyakhf

      Pages 143-158

   7. Global Inverse Consistency for Interactive Constraint Satisfaction

      • Christian Bessiere, Hélène Fargier, Christophe Lecoutre

      Pages 159-174

   8. Counting Spanning Trees to Guide Search in Constrained Spanning Tree Problems

      • Simon Brockbank, Gilles Pesant, Louis-Martin Rousseau

      Pages 175-183

   9. On the Reduction of the CSP Dichotomy Conjecture to Digraphs

      • Jakub Bulín, Dejan Delić, Marcel Jackson, Todd Niven

      Pages 184-199

   10. A Scalable Approximate Model Counter

       • Supratik Chakraborty, Kuldeep S. Meel, Moshe Y. Vardi

       Pages 200-216

   11. Dominance Driven Search

       • Geoffrey Chu, Peter J. Stuckey

       Pages 217-229

This book constitutes the refereed conference proceedings of the 18th International Conference on Principles and Practice of Constraint Programming (CP 2013), held in Uppsala, Sweden, in September 2013. The 61 revised papers presented together with 3 invited talks were carefully selected from 138 submissions. The scope of the conference is on all aspects of computing with constraints, including: theory, algorithms, environments, languages, models and systems, applications such as decision making, resource allocation, and agreement technologies.

• chaotic dynamical systems
• combinatorial optimization
• constraint programming
• topological entropy
• tractability
• algorithm analysis and problem complexity

• School of Information and Communication Technology, KTH Royal Institute of Technology, Kista, Sweden

  Christian Schulte

Policies and ethics