12. CP 2006: Nantes, France

Invited Papers

• Shabbir Ahmed:
  Global Optimization of Probabilistically Constrained Linear Programs. 1
  
• Fabrizio Grandoni, Giuseppe F. Italiano:
  Algorithms and Constraint Programming. 2-14
  
• Jean-Pierre Merlet:
  Interval Analysis and Robotics. 15
  
• Helmut Simonis:
  Constraint Based Resilience Analysis. 16-28
  

Regular Papers

• Krzysztof R. Apt, Sebastian Brand:
  Infinite Qualitative Simulations by Means of Constraint Programming. 29-43
  
• Thanasis Balafoutis, Kostas Stergiou:
  Algorithms for Stochastic CSPs. 44-58
  
• Nicolas Beldiceanu, Mats Carlsson, Sophie Demassey, Thierry Petit:
  Graph Properties Based Filtering. 59-74
  
• Christian Bessière, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan, Toby Walsh:
  The ROOTS Constraint. 75-90
  
• Alexander Brodsky, Hadon Nash:
  CoJava: Optimization Modeling by Nondeterministic Simulation. 91-106
  
• David A. Cohen, Martin C. Cooper, Peter Jeavons:
  An Algebraic Characterisation of Complexity for Valued Constraint. 107-121
  
• David A. Cohen, Martin J. Green:
  Typed Guarded Decompositions for Constraint Satisfaction. 122-136
  
• Yannis Dimopoulos, Kostas Stergiou:
  Propagation in CSP and SAT. 137-151
  
• Grégoire Dooms, Irit Katriel:
  The Minimum Spanning Tree Constraint. 152-166
  
• Matteo Gagliolo, Jürgen Schmidhuber:
  Impact of Censored Sampling on the Performance of Restart Strategies. 167-181
  
• Ian P. Gent, Christopher Jefferson, Ian Miguel:
  Watched Literals for Constraint Propagation in Minion. 182-197
  
• Alexandre Goldsztejn, Luc Jaulin:
  Inner and Outer Approximations of Existentially Quantified Equality Constraints. 198-212
  
• Frank Hutter, Youssef Hamadi, Holger H. Hoos, Kevin Leyton-Brown:
  Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms. 213-228
  
• Abdelraouf Ishtaiwi, John Thornton, Anbulagan, Abdul Sattar, Duc Nghia Pham:
  Adaptive Clause Weight Redistribution. 229-243
  
• Luc Jaulin:
  Localization of an Underwater Robot Using Interval Constraint Propagation. 244-255
  
• Peter Jonsson, Fredrik Kuivinen, Gustav Nordh:
  Approximability of Integer Programming with Generalised Constraints. 256-270
  
• Mohand Ou Idir Khemmoudj, Marc Porcheron, Hachemi Bennaceur:
  When Constraint Programming and Local Search Solve the Scheduling Problem of Electricité de France Nuclear Power Plant Outages. 271-283
  
• Christophe Lecoutre, Radoslaw Szymanek:
  Generalized Arc Consistency for Positive Table Constraints. 284-298
  
• Michele Lombardi, Michela Milano:
  Stochastic Allocation and Scheduling for Conditional Task Graphs in MPSoCs. 299-313
  
• Santiago Macho González, Carlos Ansótegui, Pedro Meseguer:
  Boosting Open CSPs. 314-328
  
• Robert Mateescu, Rina Dechter:
  Compiling Constraint Networks into AND/OR Multi-valued Decision Diagrams (AOMDDs). 329-343
  
• Laurent Michel, Andrew See, Pascal Van Hentenryck:
  Distributed Constraint-Based Local Search. 344-358
  
• Laurent Michel, Andrew See, Pascal Van Hentenryck:
  High-Level Nondeterministic Abstractions in. 359-374
  
• Paul Morris:
  A Structural Characterization of Temporal Dynamic Controllability. 375-389
  
• Bertrand Neveu, Gilles Chabert, Gilles Trombettoni:
  When Interval Analysis Helps Inter-block Backtracking. 390-405
  
• Lars Otten, Mattias Grönkvist, Devdatt P. Dubhashi:
  Randomization in Constraint Programming for Airline Planning. 406-420
  
• Duc Nghia Pham, John Thornton, Abdul Sattar:
  Towards an Efficient SAT Encoding for Temporal Reasoning. 421-436
  
• Cédric Pralet, Thomas Schiex, Gérard Verfaillie:
  Decomposition of Multi-operator Queries on Semiring-Based Graphical Models. 437-452
  
• Jean-François Puget:
  Dynamic Lex Constraints. 453-467
  
• Yossi Richter, Ari Freund, Yehuda Naveh:
  Generalizing AllDifferent: The SomeDifferent Constraint. 468-483
  
• Emma Rollon, Javier Larrosa:
  Mini-bucket Elimination with Bucket Propagation. 484-498
  
• Marko Samer, Stefan Szeider:
  Constraint Satisfaction with Bounded Treewidth Revisited. 499-513
  
• Horst Samulowitz, Jessica Davies, Fahiem Bacchus:
  Preprocessing QBF. 514-529
  
• Meinolf Sellmann:
  The Theory of Grammar Constraints. 530-544
  
• Barbara M. Smith:
  Constraint Programming Models for Graceful Graphs. 545-559
  
• Matthew J. Streeter, Stephen F. Smith:
  A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem. 560-574
  
• Guido Tack, Christian Schulte, Gert Smolka:
  Generating Propagators for Finite Set Constraints. 575-589
  
• Naoyuki Tamura, Akiko Taga, Satoshi Kitagawa, Mutsunori Banbara:
  Compiling Finite Linear CSP into SAT. 590-603
  
• Pascal Van Hentenryck, Laurent Michel:
  Differentiable Invariants. 604-619
  
• Willem Jan van Hoeve, Gilles Pesant, Louis-Martin Rousseau, Ashish Sabharwal:
  Revisiting the Sequence Constraint. 620-634
  
• Guillaume Verger, Christian Bessière:
  : A Bottom-Up Approach for Solving Quantified CSPs. 635-649
  
• Toby Walsh:
  General Symmetry Breaking Constraints. 650-664
  

Poster Papers

• Magnus Ågren, Pierre Flener, Justin Pearson:
  Inferring Variable Conflicts for Local Search. 665-669
  
• Belaid Benhamou, Mohamed Réda Saïdi:
  Reasoning by Dominance in Not-Equals Binary Constraint Networks. 670-674
  
• Ismel Brito, Pedro Meseguer:
  Distributed Stable Matching Problems with Ties and Incomplete Lists. 675-679
  
• Martin C. Cooper, Sylvain Cussat-Blanc, Marie de Roquemaurel, Pierre Régnier:
  Soft Arc Consistency Applied to Optimal Planning. 680-684
  
• Iván Dotú, Pascal Van Hentenryck:
  A Note on Low Autocorrelation Binary Sequences. 685-689
  
• Alex Ferguson, Barry O'Sullivan:
  Relaxations and Explanations for Quantified Constraint Satisfaction Problems. 690-694
  
• Pierre Flener, Justin Pearson, Meinolf Sellmann, Pascal Van Hentenryck:
  Static and Dynamic Structural Symmetry Breaking. 695-699
  
• Maria J. García de la Banda, Kim Marriott, Reza Rafeh, Mark Wallace:
  The Modelling Language Zinc. 700-705
  
• Latife Genç Kaya, John N. Hooker:
  A Filter for the Circuit Constraint. 706-710
  
• Vibhav Gogate, Rina Dechter:
  A New Algorithm for Sampling CSP Solutions Uniformly at Random. 711-715
  
• Jean-Philippe Hamiez, Jin-Kao Hao:
  Sports League Scheduling: Enumerative Search for Prob026 from CSPLib. 716-720
  
• Daniel S. Heller, Meinolf Sellmann:
  Dynamic Symmetry Breaking Restarted. 721-725
  
• Chris Houghton, David A. Cohen, Martin J. Green:
  The Effect of Constraint Representation on Structural Tractability. 726-730
  
• Tudor Hulubei, Barry O'Sullivan:
  Failure Analysis in Backtrack Search for Constraint Satisfaction. 731-735
  
• Tudor Hulubei, Barry O'Sullivan:
  Heavy-Tailed Runtime Distributions: Heuristics, Models and Optimal Refutations. 736-740
  
• Philippe Jégou, Samba Ndiaye, Cyril Terrioux:
  An Extension of Complexity Bounds and Dynamic Heuristics for Tree-Decompositions of CSP. 741-745
  
• Mohand Ou Idir Khemmoudj, Hachemi Bennaceur:
  Clique Inference Process for Solving Max-CSP. 746-750
  
• Claude-Guy Quimper, Toby Walsh:
  Global Grammar Constraints. 751-755
  
• Evan Sultanik, Pragnesh Jay Modi, William C. Regli:
  Constraint Propagation for Domain Bounding in Distributed Task Scheduling. 756-760
  
• Peter Tiedemann, Tarik Hadzic, Thomas Stuart Henney, Henrik Reif Andersen:
  Interactive Distributed Configuration. 761-765
  
• Roie Zivan, Uri Shapen, Moshe Zazone, Amnon Meisels:
  Retroactive Ordering for Dynamic Backtracking. 766-771