| Invited Papers | |
| Constraints in Program Analysis and Verification | p. 1 |
| Constraint Programming Next Challenge: Simplicity of Use | p. 5 |
| Algorithmic Adventures at the Interface of Computer Science, Statistical Physics, and Combinatorics | p. 9 |
| Challenges for Constraint Programming in Networking | p. 13 |
| Distinguished Papers | |
| Consistency and Random Constraint Satisfaction Models with a High Constraint Tightness | p. 17 |
| Statistical Regimes Across Constrainedness Regions | p. 32 |
| Constraint-Based Combinators for Local Search | p. 47 |
| Unary Resource Constraint with Optional Activities | p. 62 |
| Full Papers | |
| Constraint Propagation as a Proof System | p. 77 |
| Backtrack-Free Search for Real-Time Constraint Satisfaction | p. 92 |
| Deriving Filtering Algorithms from Constraint Checkers | p. 107 |
| Leveraging the Learning Power of Examples in Automated Constraint Acquisition | p. 123 |
| Disjoint, Partition and Intersection Constraints for Set and Multiset Variables | p. 138 |
| Decomposition and Learning for a Hard Real Time Task Allocation Problem | p. 153 |
| Quantified Constraint Satisfaction and 2-Semilattice Polymorphisms | p. 168 |
| (Smart) Look-Ahead Arc Consistency and the Pursuit of CSP Tractability | p. 182 |
| Heuristic Selection for Stochastic Search Optimization: Modeling Solution Quality by Extreme Value Theory | p. 197 |
| A Complete Characterization of Complexity for Boolean Constraint Optimization Problems | p. 212 |
| Financial Portfolio Optimisation | p. 227 |
| Bounding the Resource Availability of Partially Ordered Events with Constant Resource Impact | p. 242 |
| Monotone Literals and Learning in QBF Reasoning | p. 260 |
| Streamlined Constraint Reasoning | p. 274 |
| A Domain Consistency Algorithm for the Stretch Constraint | p. 290 |
| A Hybrid Method for Planning and Scheduling | p. 305 |
| Counting-Based Look-Ahead Schemes for Constraint Satisfaction | p. 317 |
| Completable Partial Solutions in Constraint Programming and Constraint-Based Scheduling | p. 332 |
| Set Domain Propagation Using ROBDDs | p. 347 |
| Global Constraints for Integer and Set Value Precedence | p. 362 |
| Quality of LP-Based Approximations for Highly Combinatorial Problems | p. 377 |
| Constraint Satisfaction in Semi-structured Data Graphs | p. 393 |
| Strategies for Global Optimization of Temporal Preferences | p. 408 |
| ID Walk: A Candidate List Strategy with a Simple Diversification Device | p. 423 |
| Understanding Random SAT: Beyond the Clauses-to-Variables Ratio | p. 438 |
| Symbolic Decision Procedures for QBF | p. 453 |
| Propagation Guided Large Neighborhood Search | p. 468 |
| A Regular Language Membership Constraint for Finite Sequences of Variables | p. 482 |
| Generating Robust Partial Order Schedules | p. 496 |
| Full Dynamic Substitutability by SAT Encoding | p. 512 |
| Improved Bound Computation in Presence of Several Clique Constraints | p. 527 |
| Improved Algorithms for the Global Cardinality Constraint | p. 542 |
| Impact-Based Search Strategies for Constraint Programming | p. 557 |
| The Cardinality Matrix Constraint | p. 572 |
| Controllability of Soft Temporal Constraint Problems | p. 588 |
| Hybrid Set Domains to Strengthen Constraint Propagation and Reduce Symmetries | p. 604 |
| Speeding Up Constraint Propagation | p. 619 |
| Theoretical Foundations of CP-Based Lagrangian Relaxation | p. 634 |
| A Constraint for Bin Packing | p. 648 |
| Solving Non-clausal Formulas with DPLL Search | p. 663 |
| A Hyper-arc Consistency Algorithm for the Soft Alldifferent Constraint | p. 679 |
| Efficient Strategies for (Weighted) Maximum Satisfiability | p. 690 |
| Short Papers | |
| Preprocessing Techniques for Distributed Constraint Optimization | p. 706 |
| Variable Ordering Heuristics Show Promise | p. 711 |
| The Tractability of Global Constraints | p. 716 |
| Support Inference for Generic Filtering | p. 721 |
| Strong Cost-Based Filtering for Lagrange Decomposition Applied to Network Design | p. 726 |
| The Impact of AND/OR Search Spaces on Constraint Satisfaction and Counting | p. 731 |
| A General Extension of Constraint Propagation for Constraint Optimization | p. 737 |
| How Much Backtracking Does It Take to Color Random Graphs? Rigorous Results on Heavy Tails | p. 742 |
| Solving the Crane Scheduling Problem Using Intelligent Search Schemes | p. 747 |
| Algorithms for Quantified Constraint Satisfaction Problems | p. 752 |
| Improving the Applicability of Adaptive Consistency: Preliminary Results | p. 757 |
| On-Demand Bound Computation for Best-First Constraint Optimization | p. 762 |
| A New Algorithm for Maintaining Arc Consistency After Constraint Retraction | p. 767 |
| Computing the Frequency of Partial Orders | p. 772 |
| On Tightness of Constraints | p. 777 |
| Concurrent Dynamic Backtracking for Distributed CSPs | p. 782 |
| Doctoral Papers | |
| Set Variables and Local Search | p. 788 |
| N-Kings for Dynamic Systems | p. 789 |
| Relation Variables in Qualitative Spatial Reasoning | p. 790 |
| Synchronous, Asynchronous and Hybrid Algorithms for DisCSP | p. 791 |
| Long-Term Learning for Algorithm Control | p. 792 |
| Solution Extraction with the "Critical Path" in Graphplan-Based Optimal Temporal Planning | p. 793 |
| Machine Learning for Portfolio Selection Using Structure at the Instance Level | p. 794 |
| Local Search with Maximal Independent Sets | p. 795 |
| A Dynamic Restart Strategy for Randomized BT Search | p. 796 |
| A BDD-Based Approach to Interactive Configuration | p. 797 |
| Extending Super-solutions | p. 798 |
| Choosing Efficient Representations of Abstract Variables | p. 799 |
| A Hypergraph Separator Based Variable Ordering Heuristic for Solving Real World SAT | p. 800 |
| Exploiting Symmetries via Permutations for PC Board Manufacturing | p. 801 |
| Iterative Forward Search Algorithm: Combining Local Search with Maintaining Arc Consistency and a Conflict-Based Statistics | p. 802 |
| Programming Robotic Devices with a Timed Concurrent Constraint Language | p. 803 |
| Heuristics for the Distributed Breakout Algorithm | p. 804 |
| Explanations and Numeric CSPs | p. 805 |
| Softly Constrained CP Nets | p. 806 |
| Online Constraint Solving and Rectangle Packing | p. 807 |
| Modelling Chemical Reactions Using Constraint Programming and Molecular Graphs | p. 808 |
| Constraining Special-Purpose Domain Types | p. 809 |
| Demonstrations | |
| PLASMA: A Constraint Based Planning Architecture | p. 810 |
| Applying Constraint Satisfaction Techniques to 3D Camera Control | p. 811 |
| Adaptive Enterprise Optimization Framework: AEO Server and AEO Studio | p. 812 |
| CRE2: A CP Application for Reconfiguring a Power Distribution Network for Power Losses Reduction | p. 813 |
| A Constraint-Based Planner Applied to Data Processing Domains | p. 815 |
| CLab: A C++ Library for Fast Backtrack-Free Interactive Product Configuration | p. 816 |
| A Constraint-Based System for Hiring and Managing Graduate Teaching Assistants | p. 817 |
| A Web-Based Meeting Scheduling Solver With Privacy Guarantees, Without Trusted Servers | p. 818 |
| A Constraint-Based Graphics Library for B-Prolog | p. 819 |
| Author Index | p. 821 |
| Table of Contents provided by Publisher. All Rights Reserved. |