Table of Contents

• Back to the Complexity of Universal ProgramsAlain Colmerauer. 1-20 [doi]
• A Constraint Programming Approach for Allocation and Scheduling on the CELL Broadband EngineLuca Benini, Michele Lombardi, Michela Milano, Martino Ruggiero. 21-35 [doi]
• Planning and Scheduling the Operation of a Very Large Oil Pipeline NetworkArnaldo V. Moura, Cid C. de Souza, André A. Ciré, Tony M. T. Lopes. 36-51 [doi]
• Search Strategies for Rectangle PackingHelmut Simonis, Barry O Sullivan. 52-66 [doi]
• Solving a Telecommunications Feature Subscription Configuration ProblemDavid Lesaint, Deepak Mehta, Barry O Sullivan, Luis Quesada, Nic Wilson. 67-81 [doi]
• Protein Structure Prediction with Large Neighborhood Constraint Programming SearchIván Dotú, Manuel Cebrián, Pascal Van Hentenryck, Peter Clote. 82-96 [doi]
• An Application of Constraint Programming to Superblock Instruction SchedulingAbid M. Malik, Michael Chase, Tyrel Russell, Peter van Beek. 97-111 [doi]
• Classes of Submodular Constraints Expressible by Graph CutsStanislav Zivný, Peter Jeavons. 112-127 [doi]
• Optimization of Simple Tabular Reduction for Table ConstraintsChristophe Lecoutre. 128-143 [doi]
• Universal Booleanization of Constraint ModelsJinbo Huang. 144-158 [doi]
• Flow-Based Propagators for the SEQUENCE and Related Global ConstraintsMichael J. Maher, Nina Narodytska, Claude-Guy Quimper, Toby Walsh. 159-174 [doi]
• Guiding Search in QCSP:::+::: with Back-PropagationGuillaume Verger, Christian Bessiere. 175-189 [doi]
• A New Framework for Sharp and Efficient Resolution of NCSP with Manifolds of SolutionsAlexandre Goldsztejn, Laurent Granvilliers. 190-204 [doi]
• A Branch and Bound Algorithm for Numerical MAX-CSPJean-Marie Normand, Alexandre Goldsztejn, Marc Christie, Frédéric Benhamou. 205-219 [doi]
• A Geometric Constraint over k-Dimensional Objects and Shapes Subject to Business RulesMats Carlsson, Nicolas Beldiceanu, Julien Martin. 220-234 [doi]
• Cost-Based Domain Filtering for Stochastic Constraint ProgrammingRoberto Rossi, Armagan Tarim, Brahim Hnich, Steven David Prestwich. 235-250 [doi]
• Dichotomic Search Protocols for Constrained OptimizationMeinolf Sellmann, Serdar Kadioglu. 251-265 [doi]
• Length-Lex Bounds Consistency for Knapsack ConstraintsYuri Malitsky, Meinolf Sellmann, Willem Jan van Hoeve. 266-281 [doi]
• A Framework for Hybrid Tractability Results in Boolean Weighted Constraint Satisfaction ProblemsT. K. Satish Kumar. 282-297 [doi]
• From High Girth Graphs to Hard InstancesCarlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu. 298-312 [doi]
• Switching among Non-Weighting, Clause Weighting, and Variable Weighting in Local Search for SATWanxia Wei, Chu Min Li, Harry Zhang. 313-326 [doi]
• CPBPV: A Constraint-Programming Framework for Bounded Program VerificationHélène Collavizza, Michel Rueher, Pascal Van Hentenryck. 327-341 [doi]
• Exploiting Common Subexpressions in Numerical CSPsIgnacio Araya, Bertrand Neveu, Gilles Trombettoni. 342-357 [doi]
• A Soft Constraint of Equality: Complexity and ApproximabilityEmmanuel Hebrard, Barry O Sullivan, Igor Razgon. 358-371 [doi]
• Structural Tractability of Propagated ConstraintsMartin J. Green, Christopher Jefferson. 372-386 [doi]
• Connecting ABT with Arc ConsistencyIsmel Brito, Pedro Meseguer. 387-401 [doi]
• Elicitation Strategies for Fuzzy Constraint Problems with Missing Preferences: Algorithms and Experimental StudiesMirco Gelain, Maria Silvia Pini, Francesca Rossi, Kristen Brent Venable, Toby Walsh. 402-417 [doi]
• Reformulating Positive Table Constraints Using Functional DependenciesHadrien Cambazard, Barry O Sullivan. 418-432 [doi]
• Relaxations for Compiled Over-Constrained ProblemsAlexandre Papadopoulos, Barry O Sullivan. 433-447 [doi]
• Approximate Compilation of Constraints into Multivalued Decision DiagramsTarik Hadzic, John N. Hooker, Barry O Sullivan, Peter Tiedemann. 448-462 [doi]
• Quantified Constraint OptimizationMarco Benedetti, Arnaud Lallouet, Jérémie Vautard. 463-477 [doi]
• Exploiting Decomposition in Constraint Optimization ProblemsMatthew Kitching, Fahiem Bacchus. 478-492 [doi]
• A Coinduction Rule for Entailment of Recursively Defined PropertiesJoxan Jaffar, Andrew E. Santosa, Razvan Voicu. 493-508 [doi]
• Maintaining Generalized Arc Consistency on Ad Hoc r-Ary ConstraintsKenil C. K. Cheng, Roland H. C. Yap. 509-523 [doi]
• Perfect Constraints Are TractableAndrás Z. Salamon, Peter G. Jeavons. 524-528 [doi]
• Efficiently Solving Problems Where the Solutions Form a GroupKaren E. Petrie, Christopher Jefferson. 529-533 [doi]
• Approximate Solution Sampling (and Counting) on AND/OR SpacesVibhav Gogate, Rina Dechter. 534-538 [doi]
• Model Restarts for Structural Symmetry BreakingDaniel S. Heller, Aurojit Panda, Meinolf Sellmann, Justin Yip. 539-544 [doi]
• An Elimination Algorithm for Functional ConstraintsYuanlin Zhang, Roland H. C. Yap, Chendong Li, Satyanarayana Marisetti. 545-549 [doi]
• Crossword Puzzles as a Constraint ProblemAnbulagan, Adi Botea. 550-554 [doi]
• Recent Hybrid Techniques for the Multi-Knapsack ProblemCarlos Diego Rodrigues, Philippe Michelon, Manoel B. Campêlo. 555-559 [doi]
• Edge Matching Puzzles as Hard SAT/CSP BenchmarksCarlos Ansótegui, Ramón Béjar, Cèsar Fernández, Carles Mateu. 560-565 [doi]
• Test Strategy Generation Using Quantified CSPsMartin Sachenbacher, Paul Maier. 566-570 [doi]
• Perfect Derived PropagatorsChristian Schulte, Guido Tack. 571-575 [doi]
• Refined Bounds for Instance-Based Search Complexity of Counting and Other #P ProblemsLars Otten, Rina Dechter. 576-581 [doi]
• Transforming Inconsistent Subformulas in MaxSAT Lower Bound ComputationChu Min Li, Felip Manyà, Nouredine Ould Mohamedou, Jordi Planes. 582-587 [doi]
• Semi-automatic Generation of CHR Solvers for Global ConstraintsFrank Raiser. 588-592 [doi]
• Stochastic Local Search for the Optimal Winner Determination Problem in Combinatorial AuctionsDalila Boughaci, Belaid Benhamou, Habiba Drias. 593-597 [doi]
• Revisiting the Upper Bounding Process in a Safe Branch and Bound AlgorithmAlexandre Goldsztejn, Yahia Lebbah, Claude Michel, Michel Rueher. 598-602 [doi]
• Computing All Optimal Solutions in Satisfiability Problems with PreferencesEmanuele Di Rosa, Enrico Giunchiglia, Marco Maratea. 603-607 [doi]
• On the Efficiency of Impact Based HeuristicsMarco Correia, Pedro Barahona. 608-612 [doi]
• Probabilistically Estimating Backbones and Variable Bias: Experimental OverviewEric I. Hsu, Christian J. Muise, J. Christopher Beck, Sheila A. McIlraith. 613-617 [doi]
• A New Empirical Study of Weak BackdoorsPeter Gregory, Maria Fox, Derek Long. 618-623 [doi]
• Adding Search to ZincReza Rafeh, Kim Marriott, Maria Garcia de la Banda, Nicholas Nethercote, Mark Wallace. 624-629 [doi]
• Experimenting with Small Changes in Conflict-Driven Clause Learning AlgorithmsGilles Audemard, Laurent Simon. 630-634 [doi]
• Search Space Reduction for Constraint Optimization ProblemsKenil C. K. Cheng, Roland H. C. Yap. 635-639 [doi]
• Engineering Stochastic Local Search for the Low Autocorrelation Binary Sequence ProblemSteven Halim, Roland H. C. Yap, Felix Halim. 640-645 [doi]