Principles and Practice of Constraint Programming

1. Front Matter

   PDF

2. Invited Talks

   1. A Modular Architecture for Hybrid Planning with Theories

      • Maria Fox

      Pages 1-2

   2. Teaching Constraint Programming

      • Patrick Prosser

      Pages 3-3

   3. One Problem, Two Structures, Six Solvers, and Ten Years of Personnel Scheduling

      • Louis-Martin Rousseau

      Pages 4-5

   4. Concurrent Constraint Programming Research Programmes – Redux

      • Vijay Saraswat

      Pages 6-8

3. Best Technical Track Paper

   1. On Broken Triangles

      • Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux, Bruno Zanuttini

      Pages 9-24

4. Best Application Track Paper

   1. Using CP in Automatic Test Generation for ABB Robotics’ Paint Control System

      • Morten Mossige, Arnaud Gotlieb, Hein Meling

      Pages 25-41

5. Best Student Paper

   1. On Compiling CNF into Decision-DNNF

      • Umut Oztok, Adnan Darwiche

      Pages 42-57

6. Runner-Up Best Student Paper

   1. A Complete Solver for Constraint Games

      • Thi-Van-Anh Nguyen, Arnaud Lallouet

      Pages 58-74

7. Technical Track

   1. Encoding Linear Constraints into SAT

      • Ignasi Abío, Peter J. Stuckey

      Pages 75-91

   2. Efficient Application of Max-SAT Resolution on Inconsistent Subsets

      • André Abramé, Djamal Habet

      Pages 92-107

   3. Sequential Time Splitting and Bounds Communication for a Portfolio of Optimization Solvers

      • Roberto Amadini, Peter J. Stuckey

      Pages 108-124

   4. Scoring-Based Neighborhood Dominance for the Subgraph Isomorphism Problem

      • Gilles Audemard, Christophe Lecoutre, Mouny Samy-Modeliar, Gilles Goncalves, Daniel Porumbel

      Pages 125-141

   5. Linking Prefixes and Suffixes for Constraints Encoded Using Automata with Accumulators

      • Nicolas Beldiceanu, Mats Carlsson, Pierre Flener, María Andreína Francisco Rodríguez, Justin Pearson

      Pages 142-157

   6. The Propagation Depth of Local Consistency

      • Christoph Berkholz

      Pages 158-173

   7. The Balance Constraint Family

      • Christian Bessiere, Emmanuel Hebrard, George Katsirelos, Zeynep Kiziltan, Émilie Picard-Cantin, Claude-Guy Quimper et al.

      Pages 174-189

   8. Experimental Comparison of BTD and Intelligent Backtracking: Towards an Automatic Per-instance Algorithm Selector

      • Loïc Blet, Samba Ndojh Ndiaye, Christine Solnon

      Pages 190-206

   9. Solving Intensional Weighted CSPs by Incremental Optimization with BDDs

      • Miquel Bofill, Miquel Palahí, Josep Suy, Mateu Villaret

      Pages 207-223

   10. On Backdoors to Tractable Constraint Languages

       • Clément Carbonnel, Martin C. Cooper, Emmanuel Hebrard

       Pages 224-239

   11. Nested Constraint Programs

       • Geoffrey Chu, Peter J. Stuckey

       Pages 240-255

This book constitutes the refereed conference proceedings of the 20th International Conference on Principles and Practice of Constraint Programming, CP 2014, held in Lyon, France, in September 2014.
The 65 revised papers presented together with 4 invited talks were carefully selected from 108 submissions. The scope of CP 2014 includes all aspects of computing with constraints, including theory, algorithms, environments, languages, models, systems, and applications such as decision making, resource allocation, and agreement technologies.

• MaxSAT
• SAT
• algorithms
• artificial intelligence
• constraint programming
• distributed constraint satisfaction problem
• logic
• operations research
• scheduling
• solvers
• theory of computation
• algorithm analysis and problem complexity

• Insight Centre for Data Analytics, School of Computer Science and IT, University College Cork, Cork, Ireland

  Barry O’Sullivan

Policies and ethics