Principles and Practice of Constraint Programming

1. Research Track Long Papers

   1. From High Girth Graphs to Hard Instances

      • Carlos Ansótegui, Ramón Béjar, César Fernàndez, Carles Mateu

      Pages 298-312

   2. Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SAT

      • Wanxia Wei, Chu Min Li, Harry Zhang

      Pages 313-326

   3. CPBPV: A Constraint-Programming Framework for Bounded Program Verification

      • Hélène Collavizza, Michel Rueher, Pascal Van Hentenryck

      Pages 327-341

   4. Exploiting Common Subexpressions in Numerical CSPs

      • Ignacio Araya, Bertrand Neveu, Gilles Trombettoni

      Pages 342-357

   5. A Soft Constraint of Equality: Complexity and Approximability

      • Emmanuel Hebrard, Barry O’Sullivan, Igor Razgon

      Pages 358-371

   6. Structural Tractability of Propagated Constraints

      • Martin J. Green, Christopher Jefferson

      Pages 372-386

   7. Connecting ABT with Arc Consistency

      • Ismel Brito, Pedro Meseguer

      Pages 387-401

   8. Elicitation Strategies for Fuzzy Constraint Problems with Missing Preferences: Algorithms and Experimental Studies

      • Mirco Gelain, Maria Silvia Pini, Francesca Rossi, K. Brent Venable, Toby Walsh

      Pages 402-417

   9. Reformulating Positive Table Constraints Using Functional Dependencies

      • Hadrien Cambazard, Barry O’Sullivan

      Pages 418-432

   10. Relaxations for Compiled Over-Constrained Problems

       • Alexandre Papadopoulos, Barry O’Sullivan

       Pages 433-447

   11. Approximate Compilation of Constraints into Multivalued Decision Diagrams

       • Tarik Hadzic, John N. Hooker, Barry O’Sullivan, Peter Tiedemann

       Pages 448-462

   12. Quantified Constraint Optimization

       • Marco Benedetti, Arnaud Lallouet, Jérémie Vautard

       Pages 463-477

   13. Exploiting Decomposition in Constraint Optimization Problems

       • Matthew Kitching, Fahiem Bacchus

       Pages 478-492

   14. A Coinduction Rule for Entailment of Recursively Defined Properties

       • Joxan Jaffar, Andrew E. Santosa, Răzvan Voicu

       Pages 493-508

   15. Maintaining Generalized Arc Consistency on Ad Hoc r-Ary Constraints

       • Kenil C. K. Cheng, Roland H. C. Yap

       Pages 509-523

2. Research Track Short Papers

   1. Perfect Constraints Are Tractable

      • András Z. Salamon, Peter G. Jeavons

      Pages 524-528

   2. Efficiently Solving Problems Where the Solutions Form a Group

      • Karen E. Petrie, Christopher Jefferson

      Pages 529-533

   3. Approximate Solution Sampling (and Counting) on AND/OR Spaces

      • Vibhav Gogate, Rina Dechter

      Pages 534-538

   4. Model Restarts for Structural Symmetry Breaking

      • Daniel Heller, Aurojit Panda, Meinolf Sellmann, Justin Yip

      Pages 539-544

   5. An Elimination Algorithm for Functional Constraints

      • Yuanlin Zhang, Roland H. C. Yap, Chendong Li, Satyanarayana Marisetti

      Pages 545-549

This volume contains the proceedings of the 14th International Conference on Principles and Practice of Constraint Programming (CP 2008) held in Sydney, Australia, September 14–18, 2008. The conference was held in conjunction with the International Conference on Automated Planning and Scheduling (ICAPS 2008) and the International Conference on Knowledge Representation and R- soning (KR 2008). Information about the conference can be found at the w- sitehttp://www. unimelb. edu. au/cp2008/. Held annually, the CP conference series is the premier international conference on constraint programming. The conference focuses on all aspects of computing with constraints. The CP conf- ence series is organized by the Association for Constraint Programming (ACP). Information about the conferences in the series can be found on the Web at http://www. cs. ualberta. ca/~ai/cp/. Information about ACP can be found athttp://www. a4cp. org/. CP 2008 included two calls for contributions: a call for research papers, - scribing novel contributions in the ?eld, and a call for application papers, - scribing applications of constraint technology. For the ?rst time authors could directly submit short papers for consideration by the committee. The research track received 84 long submissions and 21 short submissions and the application track received 15 long submissions. Each paper received at least three reviews, which the authors had the opportunity to see and to react to, before the papers and their reviews were discussed extensively by the members of the Program Committee.

• CSP heuristics
• Constraint
• SAT solvers
• algorithms
• approximability
• complexity
• con
• constraint logic programming
• knapsack
• protein structure
• qcsp
• rectangle packing
• submodular constraints
• superblock instruction scheduling
• table constraints

Policies and ethics